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 listDec 15, 2025 13:16Pavitra GolchhaPavitra GolchhaScore: 142,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 13:16141,8431,201,021,089945,436,000231,861,0002,469,888
2Dec 15, 2025 13:16142,0231,204,130,802947,029,000231,762,0002,461,696
3Dec 15, 2025 13:16142,0321,206,627,720946,089,000232,775,0002,486,272
4Dec 15, 2025 13:16142,2781,207,854,785946,125,000234,782,0002,473,984
5Dec 15, 2025 13:16142,3811,208,204,245950,004,000231,757,0002,285,568
6Dec 15, 2025 13:16142,4041,209,769,205945,161,000236,789,0002,285,568
7Dec 15, 2025 13:16142,5601,204,927,848946,397,000236,849,0002,449,408
8Dec 15, 2025 13:16142,6111,211,044,722948,738,000234,935,0002,400,256
9Dec 15, 2025 13:16142,7291,209,626,858947,923,000236,731,0002,277,376