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 17, 2025 08:33Ashish AhujaAshish AhujaScore: 14,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2025 08:3314,213145,731,363104,968,00012,996,0002,433,024
2Aug 17, 2025 08:3314,487146,256,367106,218,00014,028,0002,306,048
3Aug 17, 2025 08:3314,549143,441,708106,786,00013,972,0002,347,008
4Aug 17, 2025 08:3314,654147,572,531107,670,00013,957,0002,301,952
5Aug 17, 2025 08:3314,702145,644,411108,021,00014,002,0002,523,136
6Aug 17, 2025 08:3314,722147,777,536108,170,00014,022,0002,342,912
7Aug 17, 2025 08:3314,748146,623,260115,441,0006,966,0002,338,816
8Aug 17, 2025 08:3314,826153,289,987111,054,00012,005,0002,306,048
9Aug 17, 2025 08:3314,967149,811,216111,307,00012,919,0002,301,952