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 13, 2026 13:20Dominique GarmierDominique GarmierScore: 22,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 13:2022,506212,816,919184,801,0001,997,0002,289,664
2Mar 13, 2026 13:2022,518214,975,954184,901,0001,998,0002,265,088
3Mar 13, 2026 13:2022,535218,363,342184,043,0003,000,0002,269,184
4Mar 13, 2026 13:2022,536212,484,842186,050,0001,000,0002,277,376
5Mar 13, 2026 13:2022,542216,234,497185,094,0002,001,0002,289,664
6Mar 13, 2026 13:2022,544212,590,220185,115,0002,001,0002,289,664
7Mar 13, 2026 13:2022,550215,254,452186,163,0001,000,0002,289,664
8Mar 13, 2026 13:2022,556213,241,598186,216,0001,001,0002,289,664
9Mar 13, 2026 13:2022,573212,234,792187,358,00002,506,752