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 listMay 11, 2026 04:53Josu San MartinJosu San MartinScore: 4,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 04:544,03141,237,02232,374,0001,090,0002,113,536
2May 11, 2026 04:544,03743,197,65332,443,0001,067,0002,113,536
3May 11, 2026 04:544,04343,211,40532,469,0001,092,0002,113,536
4May 11, 2026 04:544,04742,107,00932,506,0001,089,0002,113,536
5May 11, 2026 04:544,04742,183,63932,522,0001,071,0002,113,536
6May 11, 2026 04:544,05241,257,27632,548,0001,084,0002,113,536
7May 11, 2026 04:544,06043,075,73932,607,0001,094,0002,113,536
8May 11, 2026 04:544,09643,263,46632,924,0001,078,0002,113,536
9May 11, 2026 04:544,11542,334,26833,098,0001,064,0002,113,536