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 3, 2026 19:28Josu San MartinJosu San MartinScore: 10,439Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 19:2910,37596,766,63479,408,0006,709,0002,117,632
2Jul 3, 2026 19:2910,39495,634,86279,516,0006,755,0002,121,728
3Jul 3, 2026 19:2910,41495,793,86479,495,0006,944,0002,125,824
4Jul 3, 2026 19:2910,41795,788,89679,642,0006,821,0002,121,728
5Jul 3, 2026 19:2910,43996,002,29579,833,0006,811,0002,117,632
6Jul 3, 2026 19:2910,44196,034,72979,872,0006,791,0002,117,632
7Jul 3, 2026 19:2910,45096,157,70179,832,0006,910,0002,121,728
8Jul 3, 2026 19:2910,45696,166,36880,059,0006,729,0002,121,728
9Jul 3, 2026 19:2910,49796,532,20780,198,0006,929,0002,117,632