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 9, 2025 20:32pseppsepScore: 49,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 20:3249,403434,899,461408,046,0002,000,0002,265,088
2Dec 9, 2025 20:3249,540435,632,214409,184,0002,000,0002,273,280
3Dec 9, 2025 20:3249,544439,959,236410,214,0001,000,0002,273,280
4Dec 9, 2025 20:3249,552442,157,304409,284,0002,001,0002,260,992
5Dec 9, 2025 20:3249,566438,837,213410,396,0001,000,0002,273,280
6Dec 9, 2025 20:3249,572440,071,688410,448,0001,001,0002,273,280
7Dec 9, 2025 20:3249,579435,486,268409,507,0001,997,0002,371,584
8Dec 9, 2025 20:3249,606443,454,015408,730,0002,998,0002,523,136
9Dec 9, 2025 20:3249,607437,620,075409,739,0001,998,0002,269,184