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 9, 2026 12:33Victor MerckléVictor MerckléScore: 36,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 12:3836,299309,957,999300,146,0001,140,0002,117,632stderr
2Sep 9, 2026 12:3836,377311,200,137300,928,0001,008,0002,117,632stderr
3Sep 9, 2026 12:3836,382311,435,473300,972,0001,006,0002,117,632stderr
4Sep 9, 2026 12:3836,382310,612,032300,828,0001,149,0002,117,632stderr
5Sep 9, 2026 12:3836,416310,889,144301,135,0001,122,0002,117,632stderr
6Sep 9, 2026 12:3836,425312,251,911301,312,0001,022,0002,117,632stderr
7Sep 9, 2026 12:3836,430310,924,709301,237,0001,137,0002,117,632stderr
8Sep 9, 2026 12:3836,476311,513,739301,743,0001,012,0002,117,632stderr
9Sep 9, 2026 12:3836,536312,495,681302,242,0001,007,0002,117,632stderr