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 listSep 17, 2026 02:44Victor MerckléVictor MerckléScore: 28,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:4627,894241,490,820230,426,0001,097,0002,117,632stderr
2Sep 17, 2026 02:4627,929241,922,486230,722,0001,091,0002,117,632stderr
3Sep 17, 2026 02:4627,935242,248,450230,762,0001,101,0002,117,632stderr
4Sep 17, 2026 02:4627,944241,804,889230,833,0001,109,0002,117,632stderr
5Sep 17, 2026 02:4628,002242,877,431231,305,0001,114,0002,117,632stderr
6Sep 17, 2026 02:4628,017243,002,358231,449,0001,095,0002,117,632stderr
7Sep 17, 2026 02:4628,043243,236,933231,644,0001,116,0002,117,632stderr
8Sep 17, 2026 02:4628,065243,447,106231,863,0001,078,0002,117,632stderr
9Sep 17, 2026 02:4628,147243,219,929232,494,0001,130,0002,117,632stderr