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 23, 2026 10:17Kevin HeaveyKevin HeaveyScore: 3,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 10:243,21735,426,51725,578,0001,127,0002,113,536
2Sep 23, 2026 10:243,21835,360,90225,601,0001,112,0002,113,536
3Sep 23, 2026 10:243,23936,004,39225,857,0001,030,0002,113,536
4Sep 23, 2026 10:243,23935,697,74925,715,0001,170,0002,113,536
5Sep 23, 2026 10:243,24235,611,33125,904,0001,012,0002,113,536
6Sep 23, 2026 10:243,24335,668,35025,899,0001,018,0002,113,536
7Sep 23, 2026 10:243,24735,835,01725,943,0001,010,0002,113,536
8Sep 23, 2026 10:243,24736,071,72325,785,0001,169,0002,113,536
9Sep 23, 2026 10:243,30436,067,23326,414,0001,016,0002,113,536