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 14:31wnwnScore: 3,491Success
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 14:313,31136,207,89826,446,0001,039,0002,113,536
2Sep 24, 2026 14:313,39637,678,86227,159,0001,034,0002,113,536
3Sep 24, 2026 14:313,46337,437,63727,705,0001,038,0002,113,536
4Sep 24, 2026 14:313,47537,577,65727,818,0001,028,0002,113,536
5Sep 24, 2026 14:313,49138,428,18227,964,0001,015,0002,113,536
6Sep 24, 2026 14:313,50338,518,45628,070,0001,010,0002,113,536
7Sep 24, 2026 14:313,50437,906,05928,050,0001,035,0002,113,536
8Sep 24, 2026 14:313,50638,554,04728,100,0001,006,0002,113,536
9Sep 24, 2026 14:313,51137,767,02428,114,0001,028,0002,113,536