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 11, 2026 21:20Victor MerckléVictor MerckléScore: 4,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 21:214,20943,339,99833,914,0001,023,0002,117,632stderr
2Aug 11, 2026 21:214,23943,624,67534,167,0001,019,0002,117,632stderr
3Aug 11, 2026 21:214,25843,733,07234,324,0001,021,0002,117,632stderr
4Aug 11, 2026 21:214,27043,928,47034,419,0001,025,0002,117,632stderr
5Aug 11, 2026 21:214,29243,990,30334,609,0001,019,0002,117,632stderr
6Aug 11, 2026 21:214,31744,827,85634,813,0001,020,0002,117,632stderr
7Aug 11, 2026 21:214,32644,947,62234,882,0001,024,0002,117,632stderr
8Aug 11, 2026 21:214,33944,813,99534,998,0001,020,0002,117,632stderr
9Aug 11, 2026 21:214,45445,298,91935,956,0001,020,0002,117,632stderr