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 15, 2026 14:11M-RochatM-RochatScore: 26,493Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 14:1226,470230,266,574218,663,0001,046,0002,113,536
2May 15, 2026 14:1226,477230,388,471218,709,0001,058,0002,113,536
3May 15, 2026 14:1226,482228,535,153218,758,0001,046,0002,113,536
4May 15, 2026 14:1226,490230,791,679218,774,0001,097,0002,113,536
5May 15, 2026 14:1226,493228,850,483218,861,0001,037,0002,113,536
6May 15, 2026 14:1226,517228,881,315219,032,0001,066,0002,113,536
7May 15, 2026 14:1226,520230,819,351219,086,0001,031,0002,113,536
8May 15, 2026 14:1226,520229,574,006219,071,0001,048,0002,113,536
9May 15, 2026 14:1226,522229,389,633219,068,0001,067,0002,113,536