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 listApr 26, 2026 13:50wnwnScore: 3,462Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 13:513,39542,579,65327,174,0001,006,0002,486,272
2Apr 26, 2026 13:513,41546,761,86327,338,0001,012,0002,482,176
3Apr 26, 2026 13:513,43345,261,77927,484,0001,017,0002,490,368
4Apr 26, 2026 13:513,44643,198,96527,587,0001,021,0002,490,368
5Apr 26, 2026 13:513,46248,910,01626,756,0001,981,0002,490,368
6Apr 26, 2026 13:513,47049,274,00826,823,0001,986,0002,486,272
7Apr 26, 2026 13:513,47644,845,65326,867,0001,990,0002,482,176
8Apr 26, 2026 13:513,54747,575,74128,429,0001,015,0002,482,176
9Apr 26, 2026 13:513,59345,995,29427,837,0001,988,0002,330,624