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 15:51TudyMTudyMScore: 35,539Success
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 15:5235,522316,307,804292,839,0001,998,0002,318,336
2Apr 26, 2026 15:5235,524310,746,104292,852,0001,998,0002,383,872
3Apr 26, 2026 15:5235,525315,091,515292,863,0001,999,0002,375,680
4Apr 26, 2026 15:5235,535316,496,253293,944,000999,0002,387,968
5Apr 26, 2026 15:5235,539313,025,767292,975,0001,999,0002,396,160
6Apr 26, 2026 15:5235,551309,749,161294,077,0001,000,0002,314,240
7Apr 26, 2026 15:5235,552316,842,039294,086,0001,000,0002,375,680
8Apr 26, 2026 15:5235,552314,389,145292,088,0003,000,0002,379,776
9Apr 26, 2026 15:5235,566311,808,851294,206,0001,000,0002,367,488