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 23:55Victor MerckléVictor MerckléScore: 4,715Success
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 23:564,70247,480,09138,017,0001,017,0002,117,632stderr
2Aug 26, 2026 23:564,70347,484,70538,020,0001,016,0002,117,632stderr
3Aug 26, 2026 23:564,71047,480,65138,077,0001,016,0002,117,632stderr
4Aug 26, 2026 23:564,71447,660,36838,114,0001,017,0002,117,632stderr
5Aug 26, 2026 23:564,71547,522,34038,122,0001,015,0002,117,632stderr
6Aug 26, 2026 23:564,72947,668,77038,236,0001,015,0002,117,632stderr
7Aug 26, 2026 23:564,73447,762,16438,284,0001,015,0002,117,632stderr
8Aug 26, 2026 23:564,73647,716,91738,299,0001,015,0002,117,632stderr
9Aug 26, 2026 23:564,75147,771,76038,422,0001,013,0002,117,632stderr