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 30, 2026 18:21Karthik ReddyKarthik ReddyScore: 3,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 18:223,42037,069,67327,295,0001,099,0002,113,536
2Sep 30, 2026 18:223,43237,531,51527,313,0001,179,0002,113,536
3Sep 30, 2026 18:223,44438,106,57627,431,0001,158,0002,113,536
4Sep 30, 2026 18:223,44637,586,52527,437,0001,170,0002,113,536
5Sep 30, 2026 18:223,44837,530,76027,476,0001,146,0002,113,536
6Sep 30, 2026 18:223,44937,504,61827,451,0001,176,0002,113,536
7Sep 30, 2026 18:223,45737,646,11127,529,0001,167,0002,113,536
8Sep 30, 2026 18:223,45937,501,71227,542,0001,172,0002,113,536
9Sep 30, 2026 18:223,46637,617,81427,598,0001,175,0002,113,536