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 23:53Victor MerckléVictor MerckléScore: 78,810Success
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 23:5478,043656,225,323642,447,0005,314,0002,117,632stderr
2Aug 12, 2026 23:5478,182657,394,436643,637,0005,276,0002,117,632stderr
3Aug 12, 2026 23:5478,214657,429,567643,757,0005,425,0002,117,632stderr
4Aug 12, 2026 23:5478,685661,522,306647,674,0005,419,0002,117,632stderr
5Aug 12, 2026 23:5478,810662,421,977648,821,0005,304,0002,117,632stderr
6Aug 12, 2026 23:5478,894663,312,033649,390,0005,432,0002,117,632stderr
7Aug 12, 2026 23:5478,975664,063,726650,459,0005,036,0002,117,632stderr
8Aug 12, 2026 23:5479,003663,946,887650,292,0005,440,0002,117,632stderr
9Aug 12, 2026 23:5479,065664,984,729650,542,0005,698,0002,117,632stderr