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 18, 2026 21:08wnwnScore: 6,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 21:085,84170,108,62648,477,00002,437,120
2Feb 18, 2026 21:085,90873,972,86547,033,0002,001,0002,437,120
3Feb 18, 2026 21:085,91072,624,69247,050,0002,002,0002,433,024
4Feb 18, 2026 21:085,92374,871,07046,153,0003,010,0002,445,312
5Feb 18, 2026 21:086,00377,545,60048,826,000996,0002,535,424
6Feb 18, 2026 21:086,01871,385,54947,953,0001,998,0002,437,120
7Feb 18, 2026 21:086,03071,867,13847,048,0003,003,0002,449,408
8Feb 18, 2026 21:086,03170,780,36849,053,0001,001,0002,449,408
9Feb 18, 2026 21:086,05171,730,32249,220,0001,004,0002,539,520