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 27, 2026 13:44Victor MerckléVictor MerckléScore: 7,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 13:447,62071,630,91362,210,0001,039,0002,113,536
2Aug 27, 2026 13:447,62171,614,96062,209,0001,046,0002,113,536
3Aug 27, 2026 13:447,63471,516,89362,326,0001,042,0002,113,536
4Aug 27, 2026 13:447,63671,805,91462,354,0001,025,0002,113,536
5Aug 27, 2026 13:447,66172,735,45962,539,0001,050,0002,113,536
6Aug 27, 2026 13:447,66571,980,89162,589,0001,031,0002,113,536
7Aug 27, 2026 13:447,69672,234,58162,864,0001,021,0002,113,536
8Aug 27, 2026 13:447,73073,256,45563,122,0001,043,0002,113,536
9Aug 27, 2026 13:447,80273,082,83363,743,0001,016,0002,113,536