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 listJan 2, 2026 19:03Josu San MartinJosu San MartinScore: 5,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 19:035,33473,143,02242,258,0002,012,0002,281,472
2Jan 2, 2026 19:035,44865,397,41142,202,0003,014,0002,363,392
3Jan 2, 2026 19:035,57974,515,76744,290,0002,013,0002,293,760
4Jan 2, 2026 19:035,66575,205,26544,021,0003,001,0002,367,488
5Jan 2, 2026 19:035,67670,277,12245,105,0002,004,0002,367,488
6Jan 2, 2026 19:035,76079,885,95647,805,00002,285,568
7Jan 2, 2026 19:035,76271,753,81346,831,000996,0002,375,680
8Jan 2, 2026 19:035,76471,194,22645,852,0001,993,0002,371,584
9Jan 2, 2026 19:035,78075,802,01846,972,000999,0002,367,488
10Jan 2, 2026 19:035,79871,169,06247,123,0001,002,0002,293,760
11Jan 2, 2026 19:035,80369,470,62646,155,0002,006,0002,293,760
12Jan 2, 2026 19:035,85475,656,13848,589,00002,363,392