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 listMar 12, 2026 13:10Sergey SerebryakovSergey SerebryakovScore: 7,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 13:107,02583,844,09557,306,0001,005,0002,273,280
2Mar 12, 2026 13:107,02682,685,34957,313,0001,005,0002,392,064
3Mar 12, 2026 13:107,03283,067,66557,356,0001,006,0002,404,352
4Mar 12, 2026 13:107,03785,387,43358,407,00002,273,280
5Mar 12, 2026 13:107,03886,519,20458,416,00002,404,352
6Mar 12, 2026 13:107,04482,216,86158,463,00002,273,280
7Mar 12, 2026 13:107,04684,333,57857,470,0001,008,0002,273,280
8Mar 12, 2026 13:107,08687,911,12356,818,0001,993,0002,396,160
9Mar 12, 2026 13:107,09283,149,65956,869,0001,995,0002,392,064
10Mar 12, 2026 13:107,49888,911,56561,227,0001,003,0002,273,280
11Mar 12, 2026 13:107,52486,805,00361,446,0001,007,0002,400,256
12Mar 12, 2026 13:107,53387,389,35660,542,0001,985,0002,396,160