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 listMay 23, 2025 11:58vahookvahookScore: 4,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2025 11:584,64162,307,49935,482,0003,041,0002,428,928
2May 23, 2025 11:584,71260,395,16937,106,0002,005,0002,428,928
3May 23, 2025 11:584,71558,232,47934,115,0005,017,0002,437,120
4May 23, 2025 11:584,72460,659,97435,188,0004,021,0002,527,232
5May 23, 2025 11:584,73764,596,42037,302,0002,016,0002,265,088
6May 23, 2025 11:584,74961,726,25137,397,0002,021,0002,531,328