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 listMar 25, 2026 21:55Dominique GarmierDominique GarmierScore: 54,876Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 21:5554,832482,283,197454,109,0001,000,0002,277,376
2Mar 25, 2026 21:5554,849482,926,922454,244,0001,000,0002,277,376
3Mar 25, 2026 21:5554,857480,966,915454,309,0001,000,0002,277,376
4Mar 25, 2026 21:5554,876478,393,368453,474,0001,997,0002,277,376
5Mar 25, 2026 21:5554,888480,483,219453,571,0001,998,0002,277,376
6Mar 25, 2026 21:5554,908487,010,438453,735,0001,998,0002,277,376