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:16Victor MerckléVictor MerckléScore: 5,796Success
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:175,75455,947,02746,706,0001,060,0002,113,536
2May 24, 2026 12:175,77057,009,13446,827,0001,070,0002,113,536
3May 24, 2026 12:175,78558,050,02146,937,0001,081,0002,113,536
4May 24, 2026 12:175,79257,674,57847,069,0001,005,0002,113,536
5May 24, 2026 12:175,79656,356,32647,073,0001,037,0002,113,536
6May 24, 2026 12:175,80256,750,31047,104,0001,055,0002,113,536
7May 24, 2026 12:175,80756,711,18247,168,0001,035,0002,113,536
8May 24, 2026 12:175,82258,069,86247,322,0001,006,0002,113,536
9May 24, 2026 12:175,82357,968,88247,290,0001,045,0002,113,536