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 27, 2026 15:22Daniel MastalerzDaniel MastalerzScore: 5,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 15:235,71456,935,52646,401,0001,030,0002,113,536
2Jun 27, 2026 15:235,71756,986,26546,413,0001,040,0002,113,536
3Jun 27, 2026 15:235,73457,080,19946,400,0001,200,0002,113,536
4Jun 27, 2026 15:235,76357,308,38546,719,0001,117,0002,113,536
5Jun 27, 2026 15:235,77057,451,33346,849,0001,043,0002,113,536
6Jun 27, 2026 15:235,77257,372,18846,860,0001,052,0002,113,536
7Jun 27, 2026 15:235,77357,402,37846,879,0001,041,0002,113,536
8Jun 27, 2026 15:235,78757,638,00847,004,0001,035,0002,113,536
9Jun 27, 2026 15:235,78757,480,45646,997,0001,042,0002,113,536