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 listAug 1, 2026 21:58TonyTonyScore: 111,234Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 21:58111,154930,893,055921,581,0001,003,0002,117,632
2Aug 1, 2026 21:58111,179931,421,287921,783,0001,003,0002,117,632
3Aug 1, 2026 21:58111,186931,456,012921,843,0001,001,0002,117,632
4Aug 1, 2026 21:58111,206931,402,469922,009,0001,002,0002,117,632
5Aug 1, 2026 21:58111,234931,929,117921,232,0002,016,0002,117,632
6Aug 1, 2026 21:58116,156972,467,829963,094,0001,002,0002,117,632
7Aug 1, 2026 21:58116,177972,730,446963,268,0001,002,0002,117,632
8Aug 1, 2026 21:58116,185972,879,131963,335,0001,002,0002,117,632
9Aug 1, 2026 21:58116,188972,820,913963,358,0001,003,0002,117,632