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 listMar 29, 2026 19:37Danylo MocherniukDanylo MocherniukScore: 8,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 19:378,29591,826,73467,851,000997,0002,293,760
2Mar 29, 2026 19:378,29993,427,10866,887,0001,996,0002,502,656
3Mar 29, 2026 19:378,30291,711,80767,909,000998,0002,293,760
4Mar 29, 2026 19:378,30294,832,04667,912,000998,0002,293,760
5Mar 29, 2026 19:378,30491,471,37166,928,0001,997,0002,293,760
6Mar 29, 2026 19:378,31297,168,05767,994,000999,0002,293,760
7Mar 29, 2026 19:378,31395,116,93668,001,0001,000,0002,293,760
8Mar 29, 2026 19:378,37799,520,43467,515,0002,015,0002,334,720
9Mar 29, 2026 19:378,67597,235,32870,001,0002,000,0002,510,848