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 15:20Victor MerckléVictor MerckléScore: 24,801Success
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 15:2024,755213,847,843204,378,0001,093,0002,117,632stderr
2Aug 25, 2026 15:2024,765213,975,425204,488,0001,062,0002,117,632stderr
3Aug 25, 2026 15:2024,769213,885,296204,574,0001,010,0002,117,632stderr
4Aug 25, 2026 15:2024,783214,741,074204,599,0001,101,0002,117,632stderr
5Aug 25, 2026 15:2024,801214,907,221204,753,0001,101,0002,117,632stderr
6Aug 25, 2026 15:2024,801214,214,325204,757,0001,096,0002,117,632stderr
7Aug 25, 2026 15:2024,804214,150,362204,777,0001,099,0002,117,632stderr
8Aug 25, 2026 15:2024,805214,245,738204,803,0001,081,0002,117,632stderr
9Aug 25, 2026 15:2026,067224,764,605215,263,0001,098,0002,117,632stderr