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 listAug 8, 2025 19:15RyhbtRyhbtScore: 58,851Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 19:1553,935472,861,744447,657,00002,281,472
2Aug 8, 2025 19:1554,413481,745,888450,628,000999,0002,506,752
3Aug 8, 2025 19:1558,419506,193,735480,876,0003,998,0002,281,472
4Aug 8, 2025 19:1558,847514,292,660488,434,00002,506,752
5Aug 8, 2025 19:1558,851518,466,330488,467,00002,281,472
6Aug 8, 2025 19:1558,859512,960,372484,535,0003,996,0002,498,560
7Aug 8, 2025 19:1558,872518,948,230484,640,0003,997,0002,277,376
8Aug 8, 2025 19:1558,880512,124,570485,709,0002,998,0002,506,752
9Aug 8, 2025 19:1558,889511,304,738485,780,0002,998,0002,277,376