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 24, 2026 19:12Karthik ReddyKarthik ReddyScore: 32,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 19:1332,781282,431,706271,080,0001,003,0002,113,536
2Sep 24, 2026 19:1332,867283,239,800271,797,0001,005,0002,113,536
3Sep 24, 2026 19:1332,870283,266,850270,799,0002,022,0002,113,536
4Sep 24, 2026 19:1332,896283,607,267272,033,0001,004,0002,113,536
5Sep 24, 2026 19:1332,897283,444,626272,046,0001,004,0002,113,536
6Sep 24, 2026 19:1333,032284,567,458273,165,0001,003,0002,113,536
7Sep 24, 2026 19:1333,046284,746,313272,275,0002,012,0002,113,536
8Sep 24, 2026 19:1334,311295,262,491283,783,0001,005,0002,113,536
9Sep 24, 2026 19:1334,347296,751,616284,084,0001,004,0002,113,536