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 16:25Josu San MartinJosu San MartinScore: 3,869Success
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 16:263,85139,436,07130,878,0001,091,0002,113,536
2May 11, 2026 16:263,86039,938,61630,950,0001,088,0002,113,536
3May 11, 2026 16:263,86139,362,89431,004,0001,043,0002,113,536
4May 11, 2026 16:263,86640,580,37131,017,0001,074,0002,113,536
5May 11, 2026 16:263,86939,828,93131,017,0001,098,0002,113,536
6May 11, 2026 16:263,88040,429,46531,098,0001,108,0002,113,536
7May 11, 2026 16:263,88842,554,21631,194,0001,081,0002,113,536
8May 11, 2026 16:263,88942,335,87231,186,0001,100,0002,113,536
9May 11, 2026 16:263,93141,372,34631,545,0001,083,0002,113,536