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 18:11Teow Hua JunTeow Hua JunScore: 10,350Success
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 18:1210,29695,066,33884,423,0001,036,0002,113,536
2Jul 6, 2026 18:1210,29795,014,67184,427,0001,041,0002,113,536
3Jul 6, 2026 18:1210,30295,097,71084,441,0001,072,0002,113,536
4Jul 6, 2026 18:1210,30695,099,80584,492,0001,051,0002,113,536
5Jul 6, 2026 18:1210,35096,075,18784,844,0001,066,0002,113,536
6Jul 6, 2026 18:1210,35195,657,59084,880,0001,037,0002,113,536
7Jul 6, 2026 18:1210,35495,571,41484,786,0001,160,0002,113,536
8Jul 6, 2026 18:1210,36396,203,92884,940,0001,080,0002,113,536
9Jul 6, 2026 18:1210,40896,865,71585,344,0001,049,0002,113,536