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 22, 2026 09:38wnwnScore: 4,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 09:394,63250,772,66637,436,0001,011,0002,478,080
2Apr 22, 2026 09:394,64158,359,40337,508,0001,013,0002,478,080
3Apr 22, 2026 09:394,64454,443,44037,532,0001,014,0002,482,176
4Apr 22, 2026 09:394,68359,296,18336,880,0001,993,0002,482,176
5Apr 22, 2026 09:394,86759,022,87939,393,0001,010,0002,330,624
6Apr 22, 2026 09:394,87656,914,95139,464,0001,011,0002,486,272
7Apr 22, 2026 09:394,89654,396,40339,629,0001,016,0002,490,368
8Apr 22, 2026 09:394,92657,378,88538,896,0001,994,0002,482,176
9Apr 22, 2026 09:394,97257,887,14440,268,0001,006,0002,490,368