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 18:40olliecrowolliecrowScore: 6,330Success
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 18:405,89178,120,23947,900,000997,0002,490,368
2Feb 11, 2026 18:405,95977,032,76846,432,0003,028,0002,506,752
3Feb 11, 2026 18:406,00178,100,47345,825,0003,984,0002,306,048
4Feb 11, 2026 18:406,33085,128,18949,512,0003,031,0002,289,664
5Feb 11, 2026 18:406,35079,156,73647,735,0004,972,0002,265,088
6Feb 11, 2026 18:406,35881,801,14747,791,0004,978,0002,510,848