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 listOct 1, 2026 08:05Karthik ReddyKarthik ReddyScore: 3,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 08:053,38137,030,08926,944,0001,125,0002,113,536
2Oct 1, 2026 08:053,38937,012,63727,027,0001,106,0002,113,536
3Oct 1, 2026 08:053,39237,081,72427,023,0001,136,0002,113,536
4Oct 1, 2026 08:053,39337,183,22427,082,0001,088,0002,113,536
5Oct 1, 2026 08:053,40037,221,23527,041,0001,182,0002,113,536
6Oct 1, 2026 08:053,40037,234,69027,131,0001,090,0002,113,536
7Oct 1, 2026 08:053,41737,550,06127,190,0001,178,0002,113,536
8Oct 1, 2026 08:053,42337,442,76927,232,0001,180,0002,113,536
9Oct 1, 2026 08:053,42637,415,64127,289,0001,151,0002,113,536