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 listSep 5, 2026 13:04wnwnScore: 3,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:043,52337,679,27428,225,0001,020,0002,113,536
2Sep 5, 2026 13:043,52637,639,51128,219,0001,049,0002,113,536
3Sep 5, 2026 13:043,52637,699,94228,271,0001,001,0002,113,536
4Sep 5, 2026 13:043,53037,702,57528,294,0001,006,0002,113,536
5Sep 5, 2026 13:043,53137,801,95028,278,0001,035,0002,113,536
6Sep 5, 2026 13:043,62638,540,39529,062,0001,036,0002,113,536
7Sep 5, 2026 13:043,72640,052,64029,899,0001,031,0002,113,536
8Sep 5, 2026 13:043,73740,232,29530,016,0001,004,0002,113,536
9Sep 5, 2026 13:043,90450,092,53531,364,0001,045,0002,113,536