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 24, 2026 18:24Victor MerckléVictor MerckléScore: 8,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 18:258,62482,530,10870,450,0001,130,0002,117,632stderr
2Aug 24, 2026 18:258,67082,564,25370,833,0001,129,0002,117,632stderr
3Aug 24, 2026 18:258,70880,918,78771,274,0001,004,0002,117,632stderr
4Aug 24, 2026 18:258,73380,761,06771,481,0001,009,0002,117,632stderr
5Aug 24, 2026 18:258,77281,837,43971,722,0001,090,0002,117,632stderr
6Aug 24, 2026 18:258,78281,243,14771,862,0001,031,0002,117,632stderr
7Aug 24, 2026 18:259,45391,025,34876,425,0002,039,0002,117,632stderr
8Aug 24, 2026 18:259,73194,024,77077,686,0003,082,0002,117,632stderr
9Aug 24, 2026 18:259,78194,763,69777,800,0003,389,0002,117,632stderr