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 16:19Josu 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 16:20043,102,50332,206,0001,092,0002,113,536expected "53679130751589928 ", got "53679130495589928 "
2May 11, 2026 16:203,85541,117,76330,909,0001,095,0002,113,536
3May 11, 2026 16:203,88243,083,49631,088,0001,136,0002,113,536
4May 11, 2026 16:203,88341,273,31331,142,0001,089,0002,113,536
5May 11, 2026 16:203,88940,238,58231,187,0001,093,0002,113,536
6May 11, 2026 16:203,89242,947,60231,206,0001,098,0002,113,536
7May 11, 2026 16:203,91142,155,77731,376,0001,092,0002,113,536
8May 11, 2026 16:203,91740,173,39831,411,0001,104,0002,113,536
9May 11, 2026 16:203,93241,052,99631,562,0001,074,0002,113,536