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 30, 2026 18:22Karthik ReddyKarthik ReddyScore: 3,428Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 18:223,41637,107,51827,249,0001,104,0002,113,536
2Sep 30, 2026 18:223,41837,211,11027,278,0001,094,0002,113,536
3Sep 30, 2026 18:223,42537,343,09827,267,0001,168,0002,113,536
4Sep 30, 2026 18:223,42637,240,65927,315,0001,128,0002,113,536
5Sep 30, 2026 18:223,42837,253,56927,282,0001,173,0002,113,536
6Sep 30, 2026 18:223,44037,478,57227,388,0001,166,0002,113,536
7Sep 30, 2026 18:223,44237,564,14127,404,0001,170,0002,113,536
8Sep 30, 2026 18:223,44837,412,45027,450,0001,171,0002,113,536
9Sep 30, 2026 18:223,45137,487,72027,633,0001,015,0002,113,536