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 16:06Karthik ReddyKarthik ReddyScore: 3,459Success
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 16:073,44137,538,86027,530,0001,033,0002,113,536
2Sep 30, 2026 16:073,44437,465,74527,555,0001,036,0002,113,536
3Sep 30, 2026 16:073,45137,502,81627,635,0001,013,0002,113,536
4Sep 30, 2026 16:073,45137,588,49027,614,0001,032,0002,113,536
5Sep 30, 2026 16:073,45937,666,59727,682,0001,028,0002,113,536
6Sep 30, 2026 16:073,46037,645,72827,677,0001,041,0002,113,536
7Sep 30, 2026 16:073,46137,668,27827,672,0001,059,0002,113,536
8Sep 30, 2026 16:073,46737,808,75427,762,0001,018,0002,113,536
9Sep 30, 2026 16:073,47639,173,01027,733,0001,122,0002,113,536