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 7, 2026 04:00wnwnScore: 3,336Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 04:09Victor Mercklé66.33CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:013,28735,096,01226,255,0001,034,0002,113,536
2Jul 7, 2026 04:013,31235,311,12226,493,0001,004,0002,113,536
3Jul 7, 2026 04:013,32735,611,29826,602,0001,015,0002,113,536
4Jul 7, 2026 04:013,32935,456,49126,614,0001,019,0002,113,536
5Jul 7, 2026 04:013,33635,673,76426,665,0001,031,0002,113,536
6Jul 7, 2026 04:013,34437,444,48926,706,0001,050,0002,113,536
7Jul 7, 2026 04:013,38537,020,42227,058,0001,045,0002,113,536
8Jul 7, 2026 04:013,45936,733,88227,690,0001,023,0002,113,536
9Jul 7, 2026 04:013,48137,426,25727,885,0001,010,0002,113,536