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 listFeb 18, 2026 20:49lipapipalipapipaScore: 6,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 20:496,22782,101,97748,640,0003,040,0002,318,336
2Feb 18, 2026 20:496,24676,330,42749,851,0001,994,0002,289,664
3Feb 18, 2026 20:496,31173,714,05949,361,0003,022,0002,424,832
4Feb 18, 2026 20:496,36484,720,90749,832,0002,989,0002,322,432
5Feb 18, 2026 20:496,41079,170,41150,193,0003,011,0002,334,720
6Feb 18, 2026 20:496,52476,147,62851,144,0003,008,0002,289,664