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 17, 2026 17:40wnwnScore: 7,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 17:407,73189,275,76562,161,0002,005,0002,420,736
2Feb 17, 2026 17:407,74593,343,15661,269,0003,013,0002,400,256
3Feb 17, 2026 17:407,74990,227,75462,304,0002,009,0002,400,256
4Feb 17, 2026 17:407,76388,019,15359,397,0005,033,0002,437,120
5Feb 17, 2026 17:407,77293,732,93361,486,0003,023,0002,293,760
6Feb 17, 2026 17:407,80090,246,84461,751,0002,987,0002,433,024
7Feb 17, 2026 17:407,84685,308,01562,113,0003,005,0002,379,776
8Feb 17, 2026 17:407,92791,702,04663,798,0001,993,0002,424,832
9Feb 17, 2026 17:407,93188,525,08763,830,0001,994,0002,437,120