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 listNov 5, 2025 14:08dhathorndhathornScore: 203,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 14:08202,9571,711,284,4251,603,514,00081,026,0002,326,528
2Nov 5, 2025 14:08203,0841,718,394,6181,585,679,00099,916,0002,428,928
3Nov 5, 2025 14:08203,1291,714,997,6931,598,023,00087,946,0002,428,928
4Nov 5, 2025 14:08203,1771,713,152,5201,596,405,00089,966,0002,326,528
5Nov 5, 2025 14:08203,1831,715,512,2111,596,507,00089,915,0002,326,528
6Nov 5, 2025 14:08203,2271,712,220,7461,581,857,000104,924,0002,326,528
7Nov 5, 2025 14:08203,2671,709,226,4981,603,160,00083,956,0002,433,024
8Nov 5, 2025 14:08203,2851,709,689,8991,604,300,00082,963,0002,326,528
9Nov 5, 2025 14:08203,3031,710,604,4201,599,449,00087,969,0002,437,120