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 00:12drewbumpasdrewbumpasScore: 145,507Success
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 00:12145,3851,217,140,6651,142,580,00064,117,0002,113,536
2Sep 14, 2026 00:12145,3871,217,087,7461,142,631,00064,088,0002,113,536
3Sep 14, 2026 00:12145,4901,217,882,5681,141,399,00066,176,0002,113,536
4Sep 14, 2026 00:12145,5001,218,014,9931,141,562,00066,095,0002,113,536
5Sep 14, 2026 00:12145,5071,218,172,6931,142,628,00065,081,0002,113,536
6Sep 14, 2026 00:12145,5081,219,115,5451,142,630,00065,094,0002,113,536
7Sep 14, 2026 00:12145,5221,218,262,4871,141,690,00066,147,0002,113,536
8Sep 14, 2026 00:12145,5231,218,285,8431,141,565,00066,282,0002,113,536
9Sep 14, 2026 00:12145,5601,218,505,8621,142,019,00066,131,0002,113,536