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 listSep 17, 2026 13:28Andrew EpsteinAndrew EpsteinScore: 16,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 13:4516,167142,944,254133,115,0001,074,0002,117,632stderr
2Sep 17, 2026 13:4516,231143,456,814133,657,0001,062,0002,117,632stderr
3Sep 17, 2026 13:4516,241143,623,397133,686,0001,119,0002,117,632stderr
4Sep 17, 2026 13:4516,253144,312,116133,834,0001,072,0002,117,632stderr
5Sep 17, 2026 13:4516,264145,071,122133,936,0001,058,0002,117,632stderr
6Sep 17, 2026 13:4516,269143,876,576133,922,0001,117,0002,117,632stderr
7Sep 17, 2026 13:4516,283143,953,222134,065,0001,089,0002,117,632stderr
8Sep 17, 2026 13:4516,289144,533,036134,063,0001,139,0002,117,632stderr
9Sep 17, 2026 13:4516,365144,672,584134,712,0001,121,0002,117,632stderr