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 03:03Karthik ReddyKarthik ReddyScore: 4,737Success
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 03:034,58548,273,19636,909,0001,148,0002,113,536
2Sep 26, 2026 03:034,67749,141,26737,680,0001,147,0002,113,536
3Sep 26, 2026 03:034,71049,473,03337,926,0001,173,0002,113,536
4Sep 26, 2026 03:034,71749,406,44138,025,0001,133,0002,113,536
5Sep 26, 2026 03:034,73749,618,40238,168,0001,156,0002,113,536
6Sep 26, 2026 03:034,76249,788,86838,382,0001,144,0002,113,536
7Sep 26, 2026 03:034,76549,804,82238,413,0001,137,0002,113,536
8Sep 26, 2026 03:034,76649,756,76738,409,0001,155,0002,113,536
9Sep 26, 2026 03:034,78049,891,55838,524,0001,150,0002,113,536