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 12, 2026 05:10Victor MerckléVictor MerckléScore: 4,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 05:114,22443,505,45433,960,0001,101,0002,117,632stderr
2Aug 12, 2026 05:114,23343,561,93934,025,0001,117,0002,117,632stderr
3Aug 12, 2026 05:114,24043,610,05334,095,0001,104,0002,117,632stderr
4Aug 12, 2026 05:114,24643,668,51834,130,0001,115,0002,117,632stderr
5Aug 12, 2026 05:114,25043,859,11033,990,0001,286,0002,117,632stderr
6Aug 12, 2026 05:114,27643,885,25734,433,0001,063,0002,117,632stderr
7Aug 12, 2026 05:114,29044,056,71434,477,0001,136,0002,117,632stderr
8Aug 12, 2026 05:114,29044,054,80934,558,0001,057,0002,117,632stderr
9Aug 12, 2026 05:114,44245,308,67735,814,0001,060,0002,117,632stderr