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 listJul 18, 2026 15:15Kevin HeaveyKevin HeaveyScore: 3,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 15:203,57639,334,12128,542,0001,145,0002,113,536
2Jul 18, 2026 15:203,60139,536,21728,725,0001,164,0002,113,536
3Jul 18, 2026 15:203,68540,198,26329,433,0001,154,0002,113,536
4Jul 18, 2026 15:203,71640,490,60229,683,0001,162,0002,113,536
5Jul 18, 2026 15:203,71940,521,90529,665,0001,203,0002,113,536
6Jul 18, 2026 15:203,81541,886,97030,532,0001,137,0002,113,536
7Jul 18, 2026 15:203,89842,055,71331,165,0001,192,0002,113,536
8Jul 18, 2026 15:203,90242,038,03731,225,0001,165,0002,113,536
9Jul 18, 2026 15:203,92042,183,76031,494,0001,042,0002,113,536