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 21:05Josu San MartinJosu San MartinScore: 8,462Success
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 21:068,39979,148,82963,109,0006,605,0002,125,824
2Jul 3, 2026 21:068,40779,420,92963,027,0006,756,0002,117,632
3Jul 3, 2026 21:068,44679,513,86063,363,0006,743,0002,117,632
4Jul 3, 2026 21:068,45779,619,92263,350,0006,846,0002,117,632
5Jul 3, 2026 21:068,46279,634,86863,516,0006,723,0002,117,632
6Jul 3, 2026 21:068,46579,623,41763,377,0006,886,0002,117,632
7Jul 3, 2026 21:068,46679,583,48663,488,0006,781,0002,117,632
8Jul 3, 2026 21:068,50579,873,71763,552,0007,041,0002,125,824
9Jul 3, 2026 21:068,55280,336,79063,890,0007,094,0002,121,728