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 02:36Andrew EpsteinAndrew EpsteinScore: 52,063Success
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 02:3751,926441,227,266429,987,0001,007,0002,117,632stderr
2Sep 17, 2026 02:3751,961441,491,905430,277,0001,003,0002,117,632stderr
3Sep 17, 2026 02:3751,964441,542,043430,293,0001,009,0002,117,632stderr
4Sep 17, 2026 02:3751,968441,639,291430,330,0001,005,0002,117,632stderr
5Sep 17, 2026 02:3752,063442,315,004431,121,0001,002,0002,117,632stderr
6Sep 17, 2026 02:3752,071442,438,523431,183,0001,008,0002,117,632stderr
7Sep 17, 2026 02:3752,156443,035,227431,892,0001,003,0002,117,632stderr
8Sep 17, 2026 02:3752,199443,405,075432,252,0001,003,0002,117,632stderr
9Sep 17, 2026 02:3754,036468,788,692447,505,0001,002,0002,117,632stderr