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 19, 2026 13:27Andrew EpsteinAndrew EpsteinScore: 3,539Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 13:343,53439,584,92028,313,0001,026,0002,125,824stderr
2Sep 19, 2026 13:343,53639,740,51628,306,0001,045,0002,125,824stderr
3Sep 19, 2026 13:343,53739,502,34128,333,0001,030,0002,125,824stderr
4Sep 19, 2026 13:343,53839,721,75028,333,0001,036,0002,125,824stderr
5Sep 19, 2026 13:343,53939,599,51528,345,0001,036,0002,125,824stderr
6Sep 19, 2026 13:343,54739,700,13628,402,0001,042,0002,125,824stderr
7Sep 19, 2026 13:343,56240,482,29728,532,0001,034,0002,125,824stderr
8Sep 19, 2026 13:343,57239,935,75428,603,0001,047,0002,125,824stderr
9Sep 19, 2026 13:343,58939,995,79428,760,0001,029,0002,125,824stderr