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 6, 2026 07:28Teow Hua JunTeow Hua JunScore: 10,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 07:2810,03092,653,75182,145,0001,112,0002,113,536
2Jul 6, 2026 07:2810,03492,796,25382,155,0001,128,0002,113,536
3Jul 6, 2026 07:2810,03692,704,62482,195,0001,106,0002,113,536
4Jul 6, 2026 07:2810,03892,911,02782,197,0001,126,0002,113,536
5Jul 6, 2026 07:2810,04492,770,31482,260,0001,110,0002,113,536
6Jul 6, 2026 07:2810,05192,795,07482,323,0001,105,0002,113,536
7Jul 6, 2026 07:2810,07893,472,00082,456,0001,192,0002,113,536
8Jul 6, 2026 07:2810,09093,185,39482,532,0001,218,0002,113,536
9Jul 6, 2026 07:2810,09493,147,87482,590,0001,196,0002,113,536