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 15, 2026 22:46marko1597marko1597Score: 6,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 23:136,09561,683,18449,451,0001,143,0002,113,536
2Aug 15, 2026 23:136,16561,192,58749,993,0001,177,0002,113,536
3Aug 15, 2026 23:136,18261,355,91750,169,0001,147,0002,113,536
4Aug 15, 2026 23:136,19561,528,10150,279,0001,144,0002,113,536
5Aug 15, 2026 23:136,20461,539,38250,344,0001,156,0002,113,536
6Aug 15, 2026 23:136,20762,248,86950,369,0001,155,0002,113,536
7Aug 15, 2026 23:136,24562,581,05550,722,0001,117,0002,113,536
8Aug 15, 2026 23:136,24661,921,36350,705,0001,138,0002,113,536
9Aug 15, 2026 23:136,50863,979,40052,873,0001,146,0002,113,536