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 13, 2026 02:00Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 02:00086,377,28376,928,0001,137,0002,113,536expected "53687314975872458 ", got "53687314975869898 "
2May 13, 2026 02:009,32884,701,05376,383,0001,044,0002,113,536
3May 13, 2026 02:009,32886,312,40076,424,0001,004,0002,113,536
4May 13, 2026 02:009,32987,561,22676,430,0001,006,0002,113,536
5May 13, 2026 02:009,32988,513,43676,436,0001,001,0002,113,536
6May 13, 2026 02:009,33186,800,92876,425,0001,025,0002,113,536
7May 13, 2026 02:009,33386,079,31076,462,0001,002,0002,113,536
8May 13, 2026 02:009,33785,237,91176,470,0001,028,0002,113,536
9May 13, 2026 02:009,36785,480,91276,723,0001,029,0002,113,536