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 27, 2026 05:46Victor MerckléVictor MerckléScore: 4,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:474,27143,796,65934,341,0001,114,0002,117,632stderr
2Aug 27, 2026 05:474,29643,981,82134,564,0001,095,0002,117,632stderr
3Aug 27, 2026 05:474,32644,242,97234,838,0001,074,0002,117,632stderr
4Aug 27, 2026 05:474,35744,509,40134,894,0001,274,0002,117,632stderr
5Aug 27, 2026 05:474,36744,644,93235,131,0001,117,0002,117,632stderr
6Aug 27, 2026 05:474,37244,679,40235,163,0001,128,0002,117,632stderr
7Aug 27, 2026 05:474,37344,666,50935,122,0001,182,0002,117,632stderr
8Aug 27, 2026 05:474,38145,340,64035,211,0001,154,0002,117,632stderr
9Aug 27, 2026 05:474,40044,858,40735,489,0001,038,0002,117,632stderr