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 listMar 27, 2026 14:04Sergey SerebryakovSergey SerebryakovScore: 6,560Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 14:046,55084,112,46553,362,0001,006,0002,400,256
2Mar 27, 2026 14:046,55775,819,94254,422,00002,396,160
3Mar 27, 2026 14:046,56076,696,51753,436,0001,008,0002,277,376
4Mar 27, 2026 14:046,56076,972,58353,436,0001,008,0002,277,376
5Mar 27, 2026 14:046,56078,657,87253,437,0001,008,0002,277,376
6Mar 27, 2026 14:046,56080,402,18454,452,00002,277,376
7Mar 27, 2026 14:046,56183,179,76054,453,00002,392,064
8Mar 27, 2026 14:046,56383,038,42954,472,00002,277,376
9Mar 27, 2026 14:046,56477,865,28854,480,00002,396,160