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 listFeb 18, 2026 10:12wnwnScore: 7,256Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:126,27374,516,77248,058,0004,004,0002,506,752
2Feb 18, 2026 10:126,32680,155,85650,483,0002,019,0002,506,752
3Feb 18, 2026 10:126,38281,434,19149,970,0002,998,0002,461,696
4Feb 18, 2026 10:127,25684,723,91156,211,0004,015,0002,420,736
5Feb 18, 2026 10:127,39387,501,77358,345,0003,017,0002,494,464
6Feb 18, 2026 10:127,47090,114,27660,998,000999,0002,396,160