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 listDec 27, 2025 03:07zypehzypehScore: 59,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 03:0759,912521,294,106497,272,00002,347,008
2Dec 27, 2025 03:0759,914518,711,502497,288,00002,375,680
3Dec 27, 2025 03:0759,915523,186,342497,298,00002,367,488
4Dec 27, 2025 03:0759,922523,251,067496,350,0001,000,0002,347,008
5Dec 27, 2025 03:0759,932523,333,000497,436,00002,498,560
6Dec 27, 2025 03:0759,957525,194,236493,649,0003,997,0002,371,584
7Dec 27, 2025 03:0759,977527,628,692496,811,000999,0002,338,816
8Dec 27, 2025 03:0760,036522,955,268496,297,0002,001,0002,482,176
9Dec 27, 2025 03:0760,116522,556,858496,964,0001,999,0002,347,008