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 29, 2026 06:58Karthik ReddyKarthik ReddyScore: 7,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 06:587,55973,022,10761,571,0001,176,0002,113,536
2Sep 29, 2026 06:587,64873,805,82962,333,0001,152,0002,113,536
3Sep 29, 2026 06:587,67073,997,34062,511,0001,155,0002,113,536
4Sep 29, 2026 06:587,70374,266,34162,791,0001,150,0002,113,536
5Sep 29, 2026 06:587,71874,393,61862,916,0001,144,0002,113,536
6Sep 29, 2026 06:587,71874,359,31162,912,0001,153,0002,113,536
7Sep 29, 2026 06:587,72174,464,64662,922,0001,169,0002,113,536
8Sep 29, 2026 06:587,74074,572,97563,242,0001,007,0002,113,536
9Sep 29, 2026 06:587,76574,869,60863,286,0001,165,0002,113,536