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 18:47Josu San MartinJosu San MartinScore: 10,931Success
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 18:4810,83699,339,21283,149,0006,796,0002,117,632
2Jul 3, 2026 18:4810,86299,535,11283,293,0006,869,0002,121,728
3Jul 3, 2026 18:4810,86599,538,82783,296,0006,889,0002,117,632
4Jul 3, 2026 18:4810,923100,038,93883,577,0007,092,0002,117,632
5Jul 3, 2026 18:4810,931100,125,72483,834,0006,896,0002,121,728
6Jul 3, 2026 18:4810,938100,171,87983,860,0006,933,0002,117,632
7Jul 3, 2026 18:4810,945100,264,87883,954,0006,891,0002,121,728
8Jul 3, 2026 18:4810,959100,364,46284,143,0006,820,0002,117,632
9Jul 3, 2026 18:4811,009100,763,14584,357,0007,021,0002,121,728