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 listJul 5, 2026 20:30Victor MerckléVictor MerckléScore: 5,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 20:305,59554,395,12645,402,0001,043,0002,117,632stderr
2Jul 5, 2026 20:305,59854,562,87045,326,0001,138,0002,117,632stderr
3Jul 5, 2026 20:305,60154,815,05145,357,0001,137,0002,117,632stderr
4Jul 5, 2026 20:305,60455,039,06945,394,0001,120,0002,117,632stderr
5Jul 5, 2026 20:305,60556,572,84045,372,0001,151,0002,117,632stderr
6Jul 5, 2026 20:305,60954,827,08745,461,0001,100,0002,117,632stderr
7Jul 5, 2026 20:305,61454,917,06345,472,0001,127,0002,117,632stderr
8Jul 5, 2026 20:305,61554,444,83445,513,0001,093,0002,117,632stderr
9Jul 5, 2026 20:305,61554,698,91845,481,0001,127,0002,117,632stderr