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 31, 2026 18:08George SeabridgeGeorge SeabridgeScore: 9,183Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 18:099,13885,908,30274,696,0001,150,0002,117,632
2Jul 31, 2026 18:099,16086,046,84574,876,0001,157,0002,117,632
3Jul 31, 2026 18:099,17087,185,80274,935,0001,184,0002,117,632
4Jul 31, 2026 18:099,17386,137,94174,957,0001,187,0002,117,632
5Jul 31, 2026 18:099,18386,219,39175,073,0001,146,0002,117,632
6Jul 31, 2026 18:099,18486,266,73275,223,0001,012,0002,117,632
7Jul 31, 2026 18:099,20387,609,62075,233,0001,155,0002,117,632
8Jul 31, 2026 18:099,20686,505,86675,270,0001,142,0002,117,632
9Jul 31, 2026 18:099,26086,806,47375,717,0001,142,0002,117,632