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 13, 2025 10:05Andrija ZarićAndrija ZarićScore: 396,055Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2025 10:05391,2333,273,319,6683,200,259,00046,974,0002,281,472
2Aug 13, 2025 10:05391,4913,276,552,1143,180,412,00068,965,0002,285,568
3Aug 13, 2025 10:05391,9493,282,993,2063,176,217,00076,956,0002,351,104
4Aug 13, 2025 10:05396,0253,311,919,8713,228,022,00058,982,0002,359,296
5Aug 13, 2025 10:05396,0553,311,654,5543,216,292,00070,962,0002,285,568
6Aug 13, 2025 10:05396,8723,322,451,9523,235,074,00058,964,0002,285,568
7Aug 13, 2025 10:05397,5813,327,223,4383,242,961,00056,964,0002,355,200
8Aug 13, 2025 10:05399,3393,344,432,9013,253,545,00060,972,0002,359,296
9Aug 13, 2025 10:05399,8853,353,943,6693,261,083,00057,965,0002,355,200