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 listAug 8, 2025 20:09Ashish AhujaAshish AhujaScore: 2,725,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 20:112,721,82728,427,367,57120,638,758,0001,952,409,0002,404,352
2Aug 8, 2025 20:152,722,45928,480,358,64320,654,100,0001,942,310,0002,449,408
3Aug 8, 2025 20:152,723,01728,419,467,80820,660,122,0001,940,923,0002,289,664
4Aug 8, 2025 20:092,724,10828,552,829,82020,646,660,0001,963,440,0002,490,368
5Aug 8, 2025 20:112,725,24528,452,171,91520,552,225,0002,067,306,0002,289,664
6Aug 8, 2025 20:152,726,55828,581,346,03920,614,088,0002,016,345,0002,457,600
7Aug 8, 2025 20:112,729,18428,478,095,56120,671,536,0001,980,692,0002,510,848
8Aug 8, 2025 20:092,733,02228,863,644,74420,701,782,0001,982,298,0002,322,432
9Aug 8, 2025 20:092,738,52128,895,035,18220,781,406,0001,948,319,0002,502,656