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 19:27Karthik ReddyKarthik ReddyScore: 3,419Success
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 19:283,41237,226,73627,306,0001,018,0002,113,536
2Sep 30, 2026 19:283,41737,194,52827,350,0001,017,0002,113,536
3Sep 30, 2026 19:283,41737,250,48227,340,0001,023,0002,113,536
4Sep 30, 2026 19:283,41737,290,24527,336,0001,028,0002,113,536
5Sep 30, 2026 19:283,41937,317,41727,358,0001,025,0002,113,536
6Sep 30, 2026 19:283,41937,344,60727,376,0001,009,0002,113,536
7Sep 30, 2026 19:283,42537,362,82527,420,0001,009,0002,113,536
8Sep 30, 2026 19:283,42537,208,48727,371,0001,062,0002,113,536
9Sep 30, 2026 19:283,43237,467,13727,316,0001,176,0002,113,536