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 listSep 1, 2026 07:31Victor MerckléVictor MerckléScore: 3,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 07:323,66939,481,24829,260,0001,193,0002,117,632stderr
2Sep 1, 2026 07:323,67138,835,19729,292,0001,184,0002,117,632stderr
3Sep 1, 2026 07:323,67338,801,57529,278,0001,209,0002,117,632stderr
4Sep 1, 2026 07:323,68338,902,33329,406,0001,168,0002,117,632stderr
5Sep 1, 2026 07:323,68839,628,30529,435,0001,180,0002,117,632stderr
6Sep 1, 2026 07:323,69939,050,10629,588,0001,117,0002,117,632stderr
7Sep 1, 2026 07:323,71139,227,09529,677,0001,132,0002,117,632stderr
8Sep 1, 2026 07:323,71739,952,82329,658,0001,194,0002,117,632stderr
9Sep 1, 2026 07:323,74639,507,37329,924,0001,171,0002,117,632stderr