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 15:42Karthik ReddyKarthik ReddyScore: 3,333Success
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 15:423,31336,573,87227,502,000020,480
2Oct 1, 2026 15:423,31336,471,90827,502,000020,480
3Oct 1, 2026 15:423,31436,601,32527,509,000020,480
4Oct 1, 2026 15:423,31536,474,33027,519,000020,480
5Oct 1, 2026 15:423,33336,694,03227,667,000020,480
6Oct 1, 2026 15:423,35836,928,87927,874,000020,480
7Oct 1, 2026 15:423,36436,983,47426,921,0001,007,00020,480
8Oct 1, 2026 15:423,42137,384,34728,400,000020,480
9Oct 1, 2026 15:423,43237,752,41528,492,000020,480