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 listSep 5, 2026 17:28CheckHarryCheckHarryScore: 4,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 17:284,26945,295,66534,416,0001,017,0002,113,536
2Sep 5, 2026 17:284,27445,409,46834,459,0001,017,0002,113,536
3Sep 5, 2026 17:284,27545,344,53134,462,0001,025,0002,113,536
4Sep 5, 2026 17:284,29145,418,60034,601,0001,020,0002,117,632
5Sep 5, 2026 17:284,29845,572,95934,664,0001,016,0002,113,536
6Sep 5, 2026 17:284,31746,965,23534,815,0001,018,0002,113,536
7Sep 5, 2026 17:284,32145,762,43034,854,0001,017,0002,113,536
8Sep 5, 2026 17:284,40046,425,32635,512,0001,016,0002,113,536
9Sep 5, 2026 17:284,48447,026,88736,204,0001,016,0002,113,536