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 listJun 18, 2025 16:04Andy BlairAndy BlairScore: 443,426Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2025 16:04442,1373,741,552,9413,146,487,000523,249,000237,568
2Jun 18, 2025 16:04442,5943,728,199,3913,113,364,000560,165,000229,376
3Jun 18, 2025 16:04443,0153,738,123,4423,110,637,000566,387,000245,760
4Jun 18, 2025 16:04443,0923,746,086,9133,101,500,000576,164,000290,816
5Jun 18, 2025 16:04443,4263,743,487,7583,113,139,000567,296,000258,048
6Jun 18, 2025 16:04443,4673,732,626,3453,104,125,000576,651,000274,432
7Jun 18, 2025 16:04443,8203,780,638,8033,130,352,000553,355,000192,512
8Jun 18, 2025 16:04444,3273,771,691,6583,132,528,000555,384,000282,624
9Jun 18, 2025 16:04444,3353,784,264,9473,130,435,000557,543,000262,144