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 listFeb 27, 2026 21:11lipapipalipapipaScore: 5,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 21:115,60972,237,19446,556,00002,400,256
2Feb 27, 2026 21:115,62779,770,43345,707,000993,0002,285,568
3Feb 27, 2026 21:115,63972,070,70144,814,0001,991,0002,285,568
4Feb 27, 2026 21:115,64173,179,23445,825,000996,0002,396,160
5Feb 27, 2026 21:115,82271,251,33347,318,0001,006,0002,404,352
6Feb 27, 2026 21:115,83871,358,56148,454,00002,281,472
7Feb 27, 2026 21:115,92567,367,70448,171,0001,003,0002,285,568
8Feb 27, 2026 21:115,93572,684,65748,258,0001,005,0002,392,064
9Feb 27, 2026 21:116,02375,730,96648,994,000999,0002,285,568