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 22, 2026 09:07Victor MerckléVictor MerckléScore: 13,468Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 09:0813,432119,237,313110,382,0001,109,0002,113,536
2May 22, 2026 09:0813,440119,403,665110,479,0001,079,0002,113,536
3May 22, 2026 09:0813,453119,432,814110,603,0001,065,0002,113,536
4May 22, 2026 09:0813,455119,494,005110,631,0001,048,0002,113,536
5May 22, 2026 09:0813,468119,570,178110,753,0001,038,0002,113,536
6May 22, 2026 09:0813,468119,566,807110,785,0001,004,0002,113,536
7May 22, 2026 09:0813,490121,266,736110,946,0001,024,0002,113,536
8May 22, 2026 09:0813,899123,284,629114,305,0001,064,0002,113,536
9May 22, 2026 09:0813,956124,024,477114,801,0001,039,0002,113,536