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 12:30Daniel MastalerzDaniel MastalerzScore: 4,618Success
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 12:314,61047,707,87037,215,0001,048,0002,113,536
2Jun 27, 2026 12:314,61147,700,61737,242,0001,035,0002,113,536
3Jun 27, 2026 12:314,61247,796,48737,263,0001,022,0002,113,536
4Jun 27, 2026 12:314,61247,735,90337,242,0001,045,0002,113,536
5Jun 27, 2026 12:314,61847,902,50137,291,0001,042,0002,113,536
6Jun 27, 2026 12:314,61947,839,65037,318,0001,022,0002,113,536
7Jun 27, 2026 12:314,65048,072,71037,558,0001,038,0002,113,536
8Jun 27, 2026 12:314,66548,158,85137,673,0001,050,0002,113,536
9Jun 27, 2026 12:314,66748,200,11237,695,0001,049,0002,113,536