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 listFeb 18, 2026 15:19wnwnScore: 7,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 15:197,58389,861,81660,939,0001,998,0002,445,312
2Feb 18, 2026 15:197,58385,137,57460,939,0001,998,0002,281,472
3Feb 18, 2026 15:197,62287,129,36662,261,0001,004,0002,281,472
4Feb 18, 2026 15:197,68588,779,05161,795,0001,993,0002,437,120
5Feb 18, 2026 15:197,68888,147,01162,815,000997,0002,277,376
6Feb 18, 2026 15:197,69187,543,73362,837,000997,0002,277,376