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 listJul 2, 2025 02:28simmusimmuScore: 265,206Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2025 02:28264,6962,216,457,6122,101,020,00095,955,0002,318,336
2Jul 2, 2025 02:28264,8202,222,845,8952,103,046,00094,956,0002,318,336
3Jul 2, 2025 02:28264,8402,224,247,3282,105,207,00092,965,0002,322,432
4Jul 2, 2025 02:28265,0662,224,317,7612,085,096,000114,950,0002,461,696
5Jul 2, 2025 02:28265,2062,227,385,0582,111,245,00089,967,0002,461,696
6Jul 2, 2025 02:28265,2742,225,412,4902,103,826,00097,945,0002,322,432
7Jul 2, 2025 02:28265,3312,234,497,4742,105,278,00096,966,0002,318,336
8Jul 2, 2025 02:28265,3322,229,732,3492,107,290,00094,968,0002,465,792
9Jul 2, 2025 02:28265,5662,232,038,2422,093,237,000110,959,0002,322,432