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 listSep 6, 2026 16:07Kevin HeaveyKevin HeaveyScore: 3,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 16:103,74039,498,96129,885,0001,164,0002,113,536
2Sep 6, 2026 16:103,79140,228,88030,297,0001,171,0002,113,536
3Sep 6, 2026 16:103,80339,999,79930,367,0001,205,0002,113,536
4Sep 6, 2026 16:103,80540,410,58130,412,0001,171,0002,113,536
5Sep 6, 2026 16:103,81439,971,53230,517,0001,144,0002,113,536
6Sep 6, 2026 16:103,81639,896,99130,644,0001,030,0002,113,536
7Sep 6, 2026 16:103,82340,170,50530,567,0001,172,0002,113,536
8Sep 6, 2026 16:103,82540,172,65830,589,0001,162,0002,113,536
9Sep 6, 2026 16:103,86840,713,29030,938,0001,168,0002,113,536