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 listJul 13, 2025 21:28Cyril SharmaCyril SharmaScore: 68,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2025 21:2868,263592,458,746508,628,00057,957,0002,285,568
2Jul 13, 2025 21:2868,319594,761,843509,046,00058,005,0002,469,888
3Jul 13, 2025 21:2868,345588,601,038513,238,00054,025,0002,277,376
4Jul 13, 2025 21:2868,399590,030,475514,739,00052,973,0002,289,664
5Jul 13, 2025 21:2868,403590,879,250517,770,00049,977,0002,285,568
6Jul 13, 2025 21:2868,423592,708,891511,923,00055,991,0002,285,568
7Jul 13, 2025 21:2868,480592,866,421517,440,00050,944,0002,461,696
8Jul 13, 2025 21:2868,544591,918,809507,923,00060,990,0002,285,568
9Jul 13, 2025 21:2868,571595,980,138523,131,00046,011,0002,285,568