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:06Karthik ReddyKarthik ReddyScore: 3,393Success
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:063,36837,007,68926,860,0001,100,0002,113,536
2Oct 1, 2026 08:063,37637,004,71626,940,0001,084,0002,113,536
3Oct 1, 2026 08:063,38037,083,84326,979,0001,082,0002,113,536
4Oct 1, 2026 08:063,38037,067,68026,972,0001,084,0002,113,536
5Oct 1, 2026 08:063,39337,151,65726,995,0001,175,0002,113,536
6Oct 1, 2026 08:063,40037,225,14427,069,0001,151,0002,113,536
7Oct 1, 2026 08:063,40037,327,14827,061,0001,167,0002,113,536
8Oct 1, 2026 08:063,41037,388,55527,278,0001,032,0002,113,536
9Oct 1, 2026 08:063,41737,387,47127,166,0001,197,0002,113,536