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 22, 2026 18:11Kasper KivimäkiKasper KivimäkiScore: 58,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 18:1257,956491,559,301425,651,00055,388,0002,113,536
2Jul 22, 2026 18:1258,004491,338,210425,893,00055,541,0002,113,536
3Jul 22, 2026 18:1258,026492,163,138426,088,00055,533,0002,113,536
4Jul 22, 2026 18:1258,042491,694,000426,144,00055,612,0002,113,536
5Jul 22, 2026 18:1258,050491,762,213426,283,00055,532,0002,113,536
6Jul 22, 2026 18:1258,159492,653,216426,163,00056,560,0002,113,536
7Jul 22, 2026 18:1258,191492,934,290426,488,00056,503,0002,113,536
8Jul 22, 2026 18:1258,208492,986,027426,525,00056,604,0002,113,536
9Jul 22, 2026 18:1258,282493,678,463426,176,00057,568,0002,113,536