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 20, 2026 15:49wnwnScore: 6,009Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 15:495,97873,793,24948,602,0001,012,0002,490,368
2Feb 20, 2026 15:505,99976,679,66147,804,0001,991,0002,277,376
3Feb 20, 2026 15:506,00373,108,32248,812,0001,016,0002,535,424
4Feb 20, 2026 15:496,00973,535,62648,857,0001,017,0002,277,376
5Feb 20, 2026 15:506,01569,731,45847,929,0001,997,0002,277,376
6Feb 20, 2026 15:496,02471,545,31547,999,0001,999,0002,277,376