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 24, 2026 17:06Victor MerckléVictor MerckléScore: 7,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 17:077,83275,360,38863,940,0001,067,0002,113,536
2May 24, 2026 17:077,83674,529,46563,984,0001,057,0002,113,536
3May 24, 2026 17:077,83873,382,21163,991,0001,066,0002,113,536
4May 24, 2026 17:077,83976,076,34664,003,0001,068,0002,113,536
5May 24, 2026 17:077,84074,845,59464,021,0001,059,0002,113,536
6May 24, 2026 17:077,84173,287,57164,008,0001,078,0002,113,536
7May 24, 2026 17:077,84875,329,45864,071,0001,070,0002,113,536
8May 24, 2026 17:077,88773,630,35964,427,0001,039,0002,113,536
9May 24, 2026 17:078,04675,288,35965,783,0001,001,0002,113,536