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 26, 2026 20:39Victor MerckléVictor MerckléScore: 7,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:397,61471,608,36862,097,0001,105,0002,117,632stderr
2Aug 26, 2026 20:397,62571,709,75562,134,0001,155,0002,117,632stderr
3Aug 26, 2026 20:397,63872,527,49962,199,0001,199,0002,117,632stderr
4Aug 26, 2026 20:397,64571,858,95362,369,0001,091,0002,117,632stderr
5Aug 26, 2026 20:397,67072,652,87362,515,0001,148,0002,117,632stderr
6Aug 26, 2026 20:397,67672,021,50962,641,0001,074,0002,117,632stderr
7Aug 26, 2026 20:397,73372,550,92462,927,0001,259,0002,117,632stderr
8Aug 26, 2026 20:397,82973,379,51163,865,0001,118,0002,117,632stderr
9Aug 26, 2026 20:397,89974,615,12764,457,0001,112,0002,117,632stderr