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:19Karthik ReddyKarthik ReddyScore: 3,401Success
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:193,36837,009,63226,884,0001,075,0002,113,536
2Oct 1, 2026 08:193,36936,953,85226,852,0001,111,0002,113,536
3Oct 1, 2026 08:193,37136,959,77226,893,0001,090,0002,113,536
4Oct 1, 2026 08:193,37837,008,67326,956,0001,082,0002,113,536
5Oct 1, 2026 08:193,40137,275,24827,095,0001,141,0002,113,536
6Oct 1, 2026 08:193,40237,171,62427,070,0001,167,0002,113,536
7Oct 1, 2026 08:193,40837,317,71127,103,0001,184,0002,113,536
8Oct 1, 2026 08:193,40937,359,85827,110,0001,185,0002,113,536
9Oct 1, 2026 08:193,41137,328,85327,149,0001,163,0002,113,536