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 25, 2026 02:11Victor MerckléVictor MerckléScore: 14,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 02:1214,472128,621,397118,997,0001,127,0002,117,632stderr
2Aug 25, 2026 02:1214,485129,340,144119,130,0001,101,0002,117,632stderr
3Aug 25, 2026 02:1214,489128,648,391119,190,0001,070,0002,117,632stderr
4Aug 25, 2026 02:1214,563129,206,240119,800,0001,076,0002,117,632stderr
5Aug 25, 2026 02:1214,581129,179,681119,940,0001,083,0002,117,632stderr
6Aug 25, 2026 02:1214,642129,979,559120,417,0001,118,0002,117,632stderr
7Aug 25, 2026 02:1214,699130,360,598120,761,0001,243,0002,117,632stderr
8Aug 25, 2026 02:1214,955132,523,744122,964,0001,163,0002,117,632stderr
9Aug 25, 2026 02:1215,022133,069,494123,562,0001,127,0002,117,632stderr