Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listOct 10, 2024 12:11Joad NacerJoad NacerScore: 8,141Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 12:117,65492,649,07763,530,00002,424,832
2Oct 10, 2024 12:117,65892,442,03563,563,00002,433,024
3Oct 10, 2024 12:117,65992,210,23962,562,0001,009,0002,514,944
4Oct 10, 2024 12:118,14195,797,94267,570,00002,531,328
5Oct 10, 2024 12:118,17099,855,79966,814,000997,0002,424,832
6Oct 10, 2024 12:118,17593,898,87365,860,0001,995,0002,424,832