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 listAug 2, 2026 08:27George SeabridgeGeorge SeabridgeScore: 7,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 08:277,79774,712,04063,630,0001,090,0002,113,536
2Aug 2, 2026 08:277,80775,490,72863,713,0001,090,0002,113,536
3Aug 2, 2026 08:277,80975,549,99863,728,0001,088,0002,113,536
4Aug 2, 2026 08:277,82875,428,49363,885,0001,088,0002,113,536
5Aug 2, 2026 08:277,83275,701,41463,918,0001,093,0002,113,536
6Aug 2, 2026 08:277,83275,013,42563,905,0001,103,0002,113,536
7Aug 2, 2026 08:277,86075,200,08564,162,0001,078,0002,113,536
8Aug 2, 2026 08:277,92177,742,04864,659,0001,092,0002,113,536
9Aug 2, 2026 08:277,98777,059,75565,186,0001,108,0002,113,536