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:18Karthik ReddyKarthik ReddyScore: 3,418Success
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:183,40337,206,03327,156,0001,095,0002,113,536
2Sep 30, 2026 18:183,40437,023,59427,161,0001,098,0002,113,536
3Sep 30, 2026 18:183,41437,172,04927,231,0001,111,0002,113,536
4Sep 30, 2026 18:183,41837,354,58427,281,0001,092,0002,113,536
5Sep 30, 2026 18:183,41837,262,98627,291,0001,080,0002,113,536
6Sep 30, 2026 18:183,42037,270,19227,292,0001,094,0002,113,536
7Sep 30, 2026 18:183,42137,295,94127,303,0001,095,0002,113,536
8Sep 30, 2026 18:183,42137,281,25927,302,0001,096,0002,113,536
9Sep 30, 2026 18:183,45737,638,38227,526,0001,171,0002,113,536