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 17:59George SeabridgeGeorge SeabridgeScore: 8,823Success
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 17:598,77682,861,01871,692,0001,157,0002,117,632
2Jul 31, 2026 17:598,78182,881,71571,739,0001,150,0002,117,632
3Jul 31, 2026 17:598,80683,123,66871,970,0001,126,0002,117,632
4Jul 31, 2026 17:598,82083,326,70772,081,0001,128,0002,117,632
5Jul 31, 2026 17:598,82383,404,60172,096,0001,138,0002,117,632
6Jul 31, 2026 17:598,82683,237,01572,113,0001,146,0002,117,632
7Jul 31, 2026 17:598,88483,862,03072,580,0001,165,0002,117,632
8Jul 31, 2026 17:598,96984,754,24173,159,0001,287,0002,117,632
9Jul 31, 2026 17:599,05385,927,77374,011,0001,134,0002,117,632