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 09:44CheckHarryCheckHarryScore: 62,014Success
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 09:4461,985538,721,436512,480,0001,997,0002,502,656
2Feb 21, 2026 09:4462,014533,195,683511,715,0002,998,0002,281,472
3Feb 21, 2026 09:4462,028536,639,823511,837,0002,999,0002,514,944