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 21, 2026 18:11Juraj ZelmanJuraj ZelmanScore: 7,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 18:117,38682,363,10459,295,0002,010,0002,367,488
2Feb 21, 2026 18:117,47191,573,36861,008,0001,000,0002,277,376
3Feb 21, 2026 18:117,48685,235,15860,131,0002,004,0002,363,392
4Feb 21, 2026 18:117,53286,151,85060,497,0002,016,0002,367,488
5Feb 21, 2026 18:117,69790,560,35161,887,0001,996,0002,281,472
6Feb 21, 2026 18:117,74986,687,17262,308,0002,009,0002,367,488