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 12:04Victor MerckléVictor MerckléScore: 3,716Success
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 12:053,68539,008,53729,429,0001,160,0002,117,632stderr
2Aug 29, 2026 12:053,69539,809,89829,522,0001,152,0002,117,632stderr
3Aug 29, 2026 12:053,70339,004,57929,606,0001,130,0002,117,632stderr
4Aug 29, 2026 12:053,71038,970,34529,660,0001,139,0002,117,632stderr
5Aug 29, 2026 12:053,71639,129,42629,773,0001,074,0002,117,632stderr
6Aug 29, 2026 12:053,74339,303,69729,978,0001,093,0002,117,632stderr
7Aug 29, 2026 12:053,83640,016,18230,682,0001,162,0002,117,632stderr
8Aug 29, 2026 12:053,89040,576,66331,227,0001,068,0002,117,632stderr
9Aug 29, 2026 12:053,90041,442,15531,263,0001,108,0002,117,632stderr