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 24, 2026 12:13Victor MerckléVictor MerckléScore: 17,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 12:1417,160151,856,823141,360,0001,071,0002,113,536
2May 24, 2026 12:1417,162152,042,322141,372,0001,074,0002,113,536
3May 24, 2026 12:1417,163152,402,387141,389,0001,071,0002,113,536
4May 24, 2026 12:1417,174152,202,928141,462,0001,087,0002,113,536
5May 24, 2026 12:1417,183152,103,500141,580,0001,041,0002,113,536
6May 24, 2026 12:1417,188150,500,473141,657,0001,006,0002,113,536
7May 24, 2026 12:1417,368153,162,791142,095,0002,060,0002,113,536
8May 24, 2026 12:1417,721157,973,114146,027,0001,064,0002,113,536
9May 24, 2026 12:1417,745155,214,445146,278,0001,008,0002,113,536