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 15, 2026 23:15wnwnScore: 8,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:157,20686,659,23051,832,0007,974,0002,465,792
2Feb 15, 2026 23:157,32486,589,84753,813,0006,975,0002,457,600
3Feb 15, 2026 23:157,42287,500,55251,669,0009,936,0002,494,464
4Feb 15, 2026 23:158,409100,478,77860,820,0008,973,0002,306,048
5Feb 15, 2026 23:158,498100,490,05659,449,00011,083,0002,514,944
6Feb 15, 2026 23:158,58895,419,24563,246,0008,031,0002,510,848