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 listFeb 11, 2026 19:27olliecrowolliecrowScore: 6,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 19:276,14879,680,10649,030,0002,001,0002,502,656
2Feb 11, 2026 19:276,15174,005,02946,049,0005,005,0002,412,544
3Feb 11, 2026 19:276,17077,941,50450,204,0001,004,0002,334,720
4Feb 11, 2026 19:276,49280,158,90450,893,0002,993,0002,355,200
5Feb 11, 2026 19:276,53980,346,74947,235,0007,035,0002,265,088
6Feb 11, 2026 19:276,55375,678,37550,358,0004,028,0002,441,216