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 listMay 17, 2026 12:18M-RochatM-RochatScore: 14,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 12:1913,996125,018,409114,022,0002,150,0002,113,536
2May 17, 2026 12:1913,998126,664,026114,048,0002,139,0002,113,536
3May 17, 2026 12:1914,018126,510,126114,196,0002,158,0002,113,536
4May 17, 2026 12:1914,028130,614,983114,283,0002,153,0002,113,536
5May 17, 2026 12:1914,034125,208,102114,339,0002,146,0002,113,536
6May 17, 2026 12:1914,037127,837,824114,343,0002,165,0002,113,536
7May 17, 2026 12:1914,050125,328,730114,443,0002,179,0002,113,536
8May 17, 2026 12:1914,062125,677,321114,473,0002,249,0002,113,536
9May 17, 2026 12:1914,120128,041,730115,023,0002,176,0002,113,536