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 17:28wnwnScore: 7,504Success
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 17:286,36579,995,26949,842,0002,990,0002,416,640
2Feb 18, 2026 17:286,36675,060,52650,842,0001,993,0002,297,856
3Feb 18, 2026 17:286,40179,677,94552,129,0001,002,0002,531,328
4Feb 18, 2026 17:287,50490,605,36360,272,0002,009,0002,412,544
5Feb 18, 2026 17:287,56986,134,22859,835,0002,991,0002,433,024
6Feb 18, 2026 17:287,92892,883,02863,811,0001,994,0002,441,216