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:08Andrija ZarićAndrija ZarićScore: 380,103Success
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:08378,9363,174,576,8543,075,213,00069,959,0002,281,472
2Aug 13, 2025 10:08379,3313,176,658,5293,091,478,00056,971,0002,363,392
3Aug 13, 2025 10:08379,6343,179,374,1083,083,009,00067,956,0002,285,568
4Aug 13, 2025 10:08380,0903,181,675,2753,110,767,00043,982,0002,281,472
5Aug 13, 2025 10:08380,1033,183,822,0563,086,883,00067,975,0002,281,472
6Aug 13, 2025 10:08380,1043,176,505,7133,102,881,00051,981,0002,285,568
7Aug 13, 2025 10:08380,2433,183,824,8633,096,038,00059,981,0002,285,568
8Aug 13, 2025 10:08380,3933,187,065,2383,078,302,00078,956,0002,359,296
9Aug 13, 2025 10:08383,2823,213,401,1003,122,274,00058,967,0002,363,392