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 18, 2026 19:31wnwnScore: 7,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 19:316,16574,129,74449,164,0002,006,0002,506,752
2Feb 18, 2026 19:316,21582,480,97350,573,0001,011,0002,281,472
3Feb 18, 2026 19:316,28478,333,14650,149,0002,005,0002,273,280
4Feb 18, 2026 19:297,05690,321,72556,542,0002,019,0002,478,080
5Feb 18, 2026 19:297,14982,948,74156,322,0003,017,0002,490,368
6Feb 18, 2026 19:317,15784,675,66456,385,0003,020,0002,412,544
7Feb 18, 2026 19:317,16983,286,23157,489,0002,017,0002,494,464
8Feb 18, 2026 19:297,17888,372,95055,542,0004,039,0002,465,792
9Feb 18, 2026 19:317,20389,316,68658,789,000996,0002,469,888