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 listApr 26, 2026 14:38TudyMTudyMScore: 56,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 14:3956,042482,542,615463,154,0002,000,0002,375,680
2Apr 26, 2026 14:3956,046488,864,727464,186,0001,000,0002,387,968
3Apr 26, 2026 14:3956,048484,528,657463,206,0002,000,0002,375,680
4Apr 26, 2026 14:3956,056480,382,140463,268,0002,001,0002,318,336
5Apr 26, 2026 14:3956,063487,567,059464,329,0001,000,0002,318,336
6Apr 26, 2026 14:3956,064481,602,612464,333,0001,000,0002,396,160
7Apr 26, 2026 14:3956,065487,457,806464,346,0001,000,0002,383,872
8Apr 26, 2026 14:3956,084484,030,879465,502,00002,310,144
9Apr 26, 2026 14:3956,089482,804,274463,542,0001,998,0002,306,048