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 01:39Andrew EpsteinAndrew EpsteinScore: 5,210Success
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 01:405,07452,468,95939,960,0002,156,0002,121,728stderr
2Sep 17, 2026 01:405,07652,479,17740,009,0002,128,0002,121,728stderr
3Sep 17, 2026 01:405,07652,481,02339,983,0002,150,0002,121,728stderr
4Sep 17, 2026 01:405,20053,446,25341,019,0002,149,0002,121,728stderr
5Sep 17, 2026 01:405,21054,360,38641,098,0002,147,0002,121,728stderr
6Sep 17, 2026 01:405,24054,646,27641,344,0002,149,0002,121,728stderr
7Sep 17, 2026 01:405,24754,676,70541,396,0002,157,0002,121,728stderr
8Sep 17, 2026 01:405,25054,775,54341,408,0002,175,0002,121,728stderr
9Sep 17, 2026 01:405,27754,942,15441,649,0002,157,0002,121,728stderr