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 10, 2026 15:18Victor MerckléVictor MerckléScore: 11,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 15:1911,870106,777,84597,393,0001,135,0002,117,632stderr
2Aug 10, 2026 15:1911,873106,895,91297,542,0001,009,0002,117,632stderr
3Aug 10, 2026 15:1911,874106,839,48997,453,0001,102,0002,117,632stderr
4Aug 10, 2026 15:1911,878106,867,47297,459,0001,132,0002,117,632stderr
5Aug 10, 2026 15:1911,911107,013,67597,770,0001,094,0002,117,632stderr
6Aug 10, 2026 15:1911,931107,441,39698,004,0001,030,0002,117,632stderr
7Aug 10, 2026 15:1911,973107,757,83698,348,0001,034,0002,117,632stderr
8Aug 10, 2026 15:1912,090108,597,82799,249,0001,102,0002,117,632stderr
9Aug 10, 2026 15:1912,160109,332,71999,834,0001,096,0002,117,632stderr