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 24, 2026 03:04wnwnScore: 3,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:043,62938,771,89626,762,0003,359,0002,113,536
2Sep 24, 2026 03:043,63538,910,12226,824,0003,347,0002,113,536
3Sep 24, 2026 03:043,66439,185,25028,604,0001,808,00020,480
4Sep 24, 2026 03:043,71040,239,46028,969,0001,826,00020,480
5Sep 24, 2026 03:043,72840,390,97629,127,0001,822,0002,113,536
6Sep 24, 2026 03:043,77240,120,64827,763,0003,547,0002,113,536
7Sep 24, 2026 03:043,81240,985,30727,897,0003,743,00020,480
8Sep 24, 2026 03:043,82941,204,93527,902,0003,881,00020,480
9Sep 24, 2026 03:043,83040,505,96927,997,0003,797,00020,480