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 14, 2026 10:57Kevin HeaveyKevin HeaveyScore: 3,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 10:593,51637,964,37327,961,0001,222,0002,113,536
2Sep 14, 2026 10:593,53238,043,40628,113,0001,207,0002,113,536
3Sep 14, 2026 10:593,54338,198,89628,211,0001,199,0002,113,536
4Sep 14, 2026 10:593,54539,424,02928,211,0001,214,0002,113,536
5Sep 14, 2026 10:593,56238,336,01228,363,0001,205,0002,113,536
6Sep 14, 2026 10:593,56238,480,15128,371,0001,196,0002,113,536
7Sep 14, 2026 10:593,56538,411,85228,409,0001,182,0002,113,536
8Sep 14, 2026 10:593,60738,932,75828,727,0001,218,0002,113,536
9Sep 14, 2026 10:593,63039,550,38028,909,0001,227,0002,113,536