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 15, 2025 13:00Ashish AhujaAshish AhujaScore: 2,067,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 13:002,064,38417,163,725,64817,067,416,00066,974,0002,277,376
2Jul 15, 2025 13:002,064,59717,168,019,11717,074,184,00061,971,0002,285,568
3Jul 15, 2025 13:002,066,03417,177,082,02317,080,113,00067,968,0002,277,376
4Jul 15, 2025 13:002,066,48317,185,329,73717,072,847,00078,966,0002,277,376
5Jul 15, 2025 13:002,067,21217,189,534,35617,088,889,00068,967,0002,277,376
6Jul 15, 2025 13:002,070,80817,216,610,97217,106,750,00080,960,0002,289,664
7Jul 15, 2025 13:002,084,23317,329,719,79217,242,164,00056,974,0002,510,848
8Jul 15, 2025 13:002,122,39617,645,868,24017,542,920,00072,970,0002,260,992
9Jul 15, 2025 13:002,265,08018,841,152,46418,731,193,00068,971,0002,277,376