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 listJul 27, 2026 01:54Kevin HeaveyKevin HeaveyScore: 5,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 01:555,01451,695,80528,763,00012,859,0002,113,536
2Jul 27, 2026 01:555,01451,790,13029,081,00012,543,00020,480
3Jul 27, 2026 01:555,01551,680,24029,324,00012,302,0002,113,536
4Jul 27, 2026 01:555,02151,750,65029,355,00012,327,0002,113,536
5Jul 27, 2026 01:555,15752,996,33829,101,00013,708,0002,113,536
6Jul 27, 2026 01:555,49755,744,75828,978,00016,652,0002,113,536
7Jul 27, 2026 01:555,51655,885,05229,579,00016,207,00020,480
8Jul 27, 2026 01:555,53156,021,70728,881,00017,033,00020,480
9Jul 27, 2026 01:555,60656,646,89628,699,00017,838,0002,113,536