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 listSep 24, 2026 03:38wnwnScore: 3,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 03:383,31336,242,37827,505,000020,480
2Sep 24, 2026 03:383,31836,330,55927,545,000020,480
3Sep 24, 2026 03:383,32336,311,34927,583,000020,480
4Sep 24, 2026 03:383,33636,503,71527,690,000020,480
5Sep 24, 2026 03:383,33836,506,81627,712,000020,480
6Sep 24, 2026 03:383,35336,668,66326,752,0001,086,0002,113,536
7Sep 24, 2026 03:383,35736,641,14826,861,0001,003,0002,113,536
8Sep 24, 2026 03:383,51637,979,06728,070,0001,119,0002,113,536
9Sep 24, 2026 03:383,53538,738,75629,347,000020,480