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 5, 2026 14:20Teow Hua JunTeow Hua JunScore: 12,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 14:2012,218110,986,967100,234,0001,178,0002,113,536
2Jul 5, 2026 14:2012,221110,856,663100,272,0001,163,0002,113,536
3Jul 5, 2026 14:2012,222110,780,648100,254,0001,190,0002,113,536
4Jul 5, 2026 14:2012,231110,950,712100,349,0001,171,0002,113,536
5Jul 5, 2026 14:2012,232110,945,363100,360,0001,168,0002,113,536
6Jul 5, 2026 14:2012,235110,955,567100,372,0001,181,0002,113,536
7Jul 5, 2026 14:2012,244111,103,043100,474,0001,156,0002,113,536
8Jul 5, 2026 14:2012,249111,096,83399,647,0002,023,0002,113,536
9Jul 5, 2026 14:2012,253111,131,495100,502,0001,205,0002,113,536