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 23, 2026 19:03Victor MerckléVictor MerckléScore: 3,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:043,74640,103,36729,958,0001,138,0002,117,632stderr
2Aug 23, 2026 19:043,75339,524,05730,039,0001,112,0002,117,632stderr
3Aug 23, 2026 19:043,75739,597,43330,073,0001,111,0002,117,632stderr
4Aug 23, 2026 19:043,76039,612,82630,059,0001,151,0002,117,632stderr
5Aug 23, 2026 19:043,77339,690,74530,215,0001,102,0002,117,632stderr
6Aug 23, 2026 19:043,78739,797,63930,372,0001,063,0002,117,632stderr
7Aug 23, 2026 19:043,82740,139,98430,683,0001,082,0002,117,632stderr
8Aug 23, 2026 19:043,84840,310,71230,821,0001,124,0002,117,632stderr
9Aug 23, 2026 19:044,04351,816,86632,426,0001,135,0002,117,632stderr