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 listSep 19, 2025 12:33limanjun99limanjun99Score: 25,809Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2025 12:3325,423239,073,929211,013,00002,273,280
2Sep 19, 2025 12:3325,791239,722,448213,062,0001,000,0002,260,992
3Sep 19, 2025 12:3325,795235,513,984213,095,0001,000,0002,273,280
4Sep 19, 2025 12:3325,796237,617,808213,103,0001,000,0002,273,280
5Sep 19, 2025 12:3325,809235,693,552214,218,00002,273,280
6Sep 19, 2025 12:3325,827248,625,606210,360,0004,006,0002,265,088
7Sep 19, 2025 12:3325,843248,586,772213,496,0001,002,0002,519,040
8Sep 19, 2025 12:3325,865240,524,700212,682,0001,997,0002,273,280
9Sep 19, 2025 12:3325,870240,137,422212,725,0001,997,0002,273,280