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 4, 2026 15:52boop34boop34Score: 29,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 15:5228,098243,385,883232,198,0001,019,0002,113,536
2Aug 4, 2026 15:5228,152243,709,450232,652,0001,015,0002,113,536
3Aug 4, 2026 15:5228,177243,962,462232,827,0001,044,0002,113,536
4Aug 4, 2026 15:5228,178244,694,323232,830,0001,048,0002,113,536
5Aug 4, 2026 15:5229,413254,173,602243,100,0001,029,0002,113,536
6Aug 4, 2026 15:5229,450255,302,849243,367,0001,075,0002,113,536
7Aug 4, 2026 15:5229,494254,882,254243,762,0001,040,0002,113,536
8Aug 4, 2026 15:5229,507255,766,767243,852,0001,060,0002,113,536
9Aug 4, 2026 15:5229,570256,322,545244,378,0001,061,0002,113,536