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 21, 2026 12:18Victor MerckléVictor MerckléScore: 4,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 12:194,65446,552,21137,563,0001,068,0002,113,536
2May 21, 2026 12:194,65551,016,15137,566,0001,076,0002,113,536
3May 21, 2026 12:194,66346,562,71837,703,0001,004,0002,113,536
4May 21, 2026 12:194,66647,326,15237,665,0001,069,0002,113,536
5May 21, 2026 12:194,66946,622,47137,699,0001,058,0002,113,536
6May 21, 2026 12:194,67047,617,10837,755,0001,006,0002,113,536
7May 21, 2026 12:194,67248,579,40937,712,0001,068,0002,113,536
8May 21, 2026 12:194,67246,653,80137,720,0001,063,0002,113,536
9May 21, 2026 12:194,87948,306,47939,498,0001,003,0002,113,536