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 4, 2026 07:05Victor MerckléVictor MerckléScore: 3,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 07:083,66539,524,49429,259,0001,166,0002,117,632stderr
2Sep 4, 2026 07:083,66739,300,46929,325,0001,112,0002,117,632stderr
3Sep 4, 2026 07:083,68938,993,62129,475,0001,151,0002,117,632stderr
4Sep 4, 2026 07:083,69339,814,88829,527,0001,131,0002,117,632stderr
5Sep 4, 2026 07:083,69939,195,09129,570,0001,132,0002,117,632stderr
6Sep 4, 2026 07:083,70538,993,53529,631,0001,124,0002,117,632stderr
7Sep 4, 2026 07:083,72139,289,67329,758,0001,127,0002,117,632stderr
8Sep 4, 2026 07:083,73940,162,46829,879,0001,156,0002,117,632stderr
9Sep 4, 2026 07:083,79839,966,10630,402,0001,123,0002,117,632stderr