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 11, 2025 14:33haxorarthaxorartScore: 2,020,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2025 14:332,019,77416,794,640,85616,706,147,00057,976,0002,277,376
2Jul 11, 2025 14:332,019,85416,800,065,23616,702,818,00061,969,0002,277,376
3Jul 11, 2025 14:332,019,91016,796,690,23716,690,287,00074,969,0002,277,376
4Jul 11, 2025 14:332,020,19916,802,167,39116,696,685,00070,968,0002,277,376
5Jul 11, 2025 14:332,020,20816,799,515,78016,698,759,00068,970,0002,289,664
6Jul 11, 2025 14:332,020,23516,802,305,06716,708,979,00058,971,0002,277,376
7Jul 11, 2025 14:332,020,36716,799,219,64216,698,072,00070,970,0002,281,472
8Jul 11, 2025 14:332,021,54916,812,267,29916,710,882,00067,971,0002,289,664
9Jul 11, 2025 14:332,024,67416,840,847,65016,743,822,00060,970,0002,277,376