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 29, 2026 11:50Victor MerckléVictor MerckléScore: 3,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 11:523,68338,920,71429,420,0001,151,0002,117,632stderr
2Aug 29, 2026 11:523,68438,926,25329,499,0001,083,0002,117,632stderr
3Aug 29, 2026 11:523,68738,914,34629,500,0001,104,0002,117,632stderr
4Aug 29, 2026 11:523,69139,012,15429,570,0001,070,0002,117,632stderr
5Aug 29, 2026 11:523,69440,174,98929,525,0001,136,0002,117,632stderr
6Aug 29, 2026 11:523,69538,947,11729,524,0001,145,0002,117,632stderr
7Aug 29, 2026 11:523,70739,619,50329,631,0001,145,0002,117,632stderr
8Aug 29, 2026 11:523,71039,187,22429,664,0001,129,0002,117,632stderr
9Aug 29, 2026 11:523,74539,454,34130,022,0001,066,0002,117,632stderr