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 03:39Cyril SharmaCyril SharmaScore: 2,065,565Success
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 03:392,057,61917,109,800,63817,015,272,00062,967,0002,277,376
2Jul 13, 2025 03:392,061,04417,138,358,79417,028,701,00077,966,0002,277,376
3Jul 13, 2025 03:392,063,69717,161,251,51117,073,708,00054,976,0002,277,376
4Jul 13, 2025 03:392,064,85917,169,904,16617,079,354,00058,973,0002,375,680
5Jul 13, 2025 03:392,065,56517,172,497,72717,086,217,00057,976,0002,277,376
6Jul 13, 2025 03:392,065,62017,181,217,53217,084,667,00059,977,0002,277,376
7Jul 13, 2025 03:392,066,20017,185,536,39417,087,488,00061,972,0002,277,376
8Jul 13, 2025 03:392,066,28317,180,524,85917,085,183,00064,970,0002,277,376
9Jul 13, 2025 03:392,077,02817,270,739,02317,167,366,00071,963,0002,260,992