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 listFeb 15, 2026 19:55Mikołaj UzarskiMikołaj UzarskiScore: 6,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 19:556,04275,306,32946,139,0004,012,0002,453,504
2Feb 15, 2026 19:556,07973,868,85444,399,0006,054,0002,404,352
3Feb 15, 2026 19:556,10485,413,17843,571,0007,093,0002,465,792