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 28, 2026 07:16Karthik ReddyKarthik ReddyScore: 5,078Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2026 07:174,95751,481,43340,068,0001,077,0002,113,536
2Sep 28, 2026 07:174,98051,707,77940,264,0001,075,0002,113,536
3Sep 28, 2026 07:175,05852,329,99040,945,0001,037,0002,113,536
4Sep 28, 2026 07:175,06852,315,38441,019,0001,049,0002,113,536
5Sep 28, 2026 07:175,07852,463,54140,993,0001,159,0002,113,536
6Sep 28, 2026 07:175,08052,434,90741,130,0001,035,0002,113,536
7Sep 28, 2026 07:175,08953,856,15241,170,0001,075,0002,113,536
8Sep 28, 2026 07:175,09052,526,09241,221,0001,028,0002,113,536
9Sep 28, 2026 07:175,09752,653,19541,264,0001,042,0002,113,536