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 26, 2026 00:23Karthik ReddyKarthik ReddyScore: 4,598Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2026 00:234,58348,228,57536,896,0001,146,0002,113,536
2Sep 26, 2026 00:234,58748,313,71736,935,0001,138,0002,113,536
3Sep 26, 2026 00:234,59248,386,83936,962,0001,152,0002,113,536
4Sep 26, 2026 00:234,59248,435,66136,986,0001,130,0002,113,536
5Sep 26, 2026 00:234,59848,376,46237,032,0001,139,0002,113,536
6Sep 26, 2026 00:234,61248,576,16437,102,0001,181,0002,113,536
7Sep 26, 2026 00:234,61549,910,21137,240,0001,071,0002,113,536
8Sep 26, 2026 00:234,66348,952,18737,574,0001,133,0002,113,536
9Sep 26, 2026 00:234,76249,782,49338,380,0001,152,0002,113,536