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 13:32Daniel MastalerzDaniel MastalerzScore: 4,350Success
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 13:324,32845,319,05834,898,0001,027,0002,113,536
2Jun 27, 2026 13:324,33945,460,71334,987,0001,031,0002,113,536
3Jun 27, 2026 13:324,34245,531,69935,002,0001,037,0002,113,536
4Jun 27, 2026 13:324,34845,524,51935,066,0001,030,0002,113,536
5Jun 27, 2026 13:324,35045,597,94535,077,0001,029,0002,113,536
6Jun 27, 2026 13:324,35445,616,19535,099,0001,042,0002,113,536
7Jun 27, 2026 13:324,35945,644,62735,144,0001,041,0002,113,536
8Jun 27, 2026 13:324,37345,714,71135,275,0001,023,0002,113,536
9Jun 27, 2026 13:324,37745,815,09035,281,0001,056,0002,113,536