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 13:13George SeabridgeGeorge SeabridgeScore: 8,151Success
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 13:136,84166,781,26055,700,0001,086,0002,113,536
2Aug 1, 2026 13:136,84466,758,44355,717,0001,090,0002,113,536
3Aug 1, 2026 13:136,88167,111,74656,034,0001,080,0002,113,536
4Aug 1, 2026 13:138,12477,539,66666,397,0001,034,0002,113,536
5Aug 1, 2026 13:138,15177,645,62766,575,0001,083,0002,113,536
6Aug 1, 2026 13:138,16479,034,45066,664,0001,098,0002,113,536
7Aug 1, 2026 13:138,19578,020,03566,932,0001,093,0002,113,536
8Aug 1, 2026 13:138,30778,913,35867,925,0001,024,0002,113,536
9Aug 1, 2026 13:138,33479,167,98668,060,0001,117,0002,113,536