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 listJan 30, 2026 19:39olliecrowolliecrowScore: 25,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2026 19:3925,216237,026,745207,291,0002,002,0002,277,376
2Jan 30, 2026 19:3925,253236,908,871209,602,00002,433,024
3Jan 30, 2026 19:3925,295235,517,540207,946,0001,999,0002,289,664
4Jan 30, 2026 19:3925,312230,517,568206,088,0004,001,0002,334,720
5Jan 30, 2026 19:3925,325237,816,080207,199,0003,002,0002,510,848
6Jan 30, 2026 19:3925,384240,826,188207,689,0002,995,0002,289,664
7Jan 30, 2026 19:3925,656234,342,404210,949,0001,999,0002,314,240
8Jan 30, 2026 19:3925,689235,794,313212,220,0001,001,0002,342,912
9Jan 30, 2026 19:3925,716239,035,506212,442,0001,002,0002,273,280