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 listOct 1, 2026 07:48Karthik ReddyKarthik ReddyScore: 3,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 07:483,37937,114,57326,949,0001,100,0002,113,536
2Oct 1, 2026 07:483,38037,045,84026,981,0001,081,0002,113,536
3Oct 1, 2026 07:483,38137,119,82226,957,0001,106,0002,113,536
4Oct 1, 2026 07:483,38337,033,07026,999,0001,082,0002,113,536
5Oct 1, 2026 07:483,38537,071,38126,996,0001,103,0002,113,536
6Oct 1, 2026 07:483,38537,132,00227,021,0001,082,0002,113,536
7Oct 1, 2026 07:483,39038,044,90227,060,0001,082,0002,113,536
8Oct 1, 2026 07:483,42137,459,05527,205,0001,190,0002,113,536
9Oct 1, 2026 07:483,43137,489,08327,457,0001,022,0002,113,536