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 listDec 8, 2025 20:24pseppsepScore: 2,068,545Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 20:242,064,82317,172,367,79517,070,064,00067,968,0002,277,376
2Dec 8, 2025 20:242,065,78317,176,143,77017,078,033,00067,968,0002,277,376
3Dec 8, 2025 20:242,066,09317,179,799,26117,066,601,00081,969,0002,277,376
4Dec 8, 2025 20:242,066,86117,188,199,66017,088,973,00065,972,0002,277,376
5Dec 8, 2025 20:242,068,54517,203,885,23117,094,955,00073,969,0002,277,376
6Dec 8, 2025 20:242,068,73817,200,557,02117,104,558,00065,971,0002,277,376
7Dec 8, 2025 20:242,070,35717,214,487,73217,113,995,00069,971,0002,277,376
8Dec 8, 2025 20:242,075,09717,252,367,78217,172,324,00050,977,0002,277,376
9Dec 8, 2025 20:242,264,84518,829,720,69118,712,249,00085,964,0002,265,088