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 04:48Josu San MartinJosu San MartinError
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 04:48039,425,23531,033,0001,077,0002,113,536expected "53682733128719969 ", got "53682730983992234 "
2May 11, 2026 04:483,86039,755,79430,974,0001,067,0002,113,536
3May 11, 2026 04:483,87241,533,25531,054,0001,085,0002,113,536
4May 11, 2026 04:483,87539,759,83431,119,0001,049,0002,113,536
5May 11, 2026 04:483,88140,408,81231,140,0001,073,0002,113,536
6May 11, 2026 04:483,88339,883,09831,145,0001,089,0002,113,536
7May 11, 2026 04:483,88742,003,30031,232,0001,035,0002,113,536
8May 11, 2026 04:483,94342,427,02331,636,0001,092,0002,113,536
9May 11, 2026 04:484,00141,865,39532,136,0001,075,0002,113,536