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 listJun 19, 2026 16:33A_ShamanA_ShamanScore: 48,703Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 16:3348,622412,614,608402,562,0001,004,0002,113,536
2Jun 19, 2026 16:3348,664412,979,425402,909,0001,005,0002,113,536
3Jun 19, 2026 16:3348,685413,052,925403,087,0001,004,0002,113,536
4Jun 19, 2026 16:3348,693413,218,876403,154,0001,005,0002,113,536
5Jun 19, 2026 16:3348,703413,384,078403,232,0001,003,0002,113,536
6Jun 19, 2026 16:3348,715413,406,918403,334,0001,005,0002,113,536
7Jun 19, 2026 16:3348,715413,396,058403,336,0001,003,0002,113,536
8Jun 19, 2026 16:3348,722413,352,370403,395,0001,004,0002,113,536
9Jun 19, 2026 16:3348,747413,805,566403,597,0001,005,0002,113,536