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 11, 2026 10:59RabenknechtRabenknechtScore: 65,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 11:0065,460553,289,220542,296,0001,025,0002,113,536
2Aug 11, 2026 11:0065,509554,490,321542,676,0001,056,0002,117,632
3Aug 11, 2026 11:0065,512553,809,251542,715,0001,036,0002,113,536
4Aug 11, 2026 11:0065,674555,196,386544,054,0001,047,0002,113,536
5Aug 11, 2026 11:0065,746555,815,179544,597,0001,101,0002,113,536
6Aug 11, 2026 11:0065,827557,420,661545,362,0001,004,0002,113,536
7Aug 11, 2026 11:0065,892557,022,518545,796,0001,115,0002,113,536
8Aug 11, 2026 11:0066,008557,989,569546,863,0001,005,0002,113,536
9Aug 11, 2026 11:0066,176559,282,876548,196,0001,066,0002,113,536