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 20:28Josu San MartinJosu San MartinScore: 12,165Success
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 20:2912,083109,632,09893,781,0006,512,0002,117,632
2Jul 3, 2026 20:2912,087109,620,16493,866,0006,459,0002,121,728
3Jul 3, 2026 20:2912,110109,781,87993,947,0006,571,0002,121,728
4Jul 3, 2026 20:2912,162110,263,49994,100,0006,850,0002,117,632
5Jul 3, 2026 20:2912,165110,306,43094,289,0006,681,0002,121,728
6Jul 3, 2026 20:2912,203110,633,04694,776,0006,516,0002,117,632
7Jul 3, 2026 20:2912,207111,972,69194,413,0006,912,0002,121,728
8Jul 3, 2026 20:2912,258111,221,46195,035,0006,714,0002,121,728
9Jul 3, 2026 20:2912,295111,406,80295,395,0006,657,0002,121,728