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 04:43Teow Hua JunTeow Hua JunScore: 11,171Success
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 04:4311,106101,515,11581,976,00010,208,0002,113,536
2Jul 6, 2026 04:4311,120101,672,34982,760,0009,542,0002,113,536
3Jul 6, 2026 04:4311,152102,024,15782,334,00010,229,0002,113,536
4Jul 6, 2026 04:4311,152101,874,73482,118,00010,451,0002,113,536
5Jul 6, 2026 04:4311,171102,146,45782,789,0009,936,0002,113,536
6Jul 6, 2026 04:4311,174102,126,04782,091,00010,655,0002,113,536
7Jul 6, 2026 04:4311,225102,612,00582,581,00010,587,0002,113,536
8Jul 6, 2026 04:4311,288103,150,71682,715,00010,983,0002,113,536
9Jul 6, 2026 04:4311,321103,358,97783,263,00010,707,0002,113,536