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:23Karthik ReddyKarthik ReddyScore: 3,471Success
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:233,44637,617,88927,554,0001,051,0002,113,536
2Oct 1, 2026 07:233,46137,697,48827,683,0001,049,0002,113,536
3Oct 1, 2026 07:233,46437,766,77427,714,0001,043,0002,113,536
4Oct 1, 2026 07:233,47037,870,56027,670,0001,136,0002,113,536
5Oct 1, 2026 07:233,47137,824,25727,754,0001,063,0002,113,536
6Oct 1, 2026 07:233,47137,781,66127,690,0001,127,0002,113,536
7Oct 1, 2026 07:233,47337,827,77927,700,0001,132,0002,113,536
8Oct 1, 2026 07:233,47537,967,99327,709,0001,140,0002,113,536
9Oct 1, 2026 07:233,47938,018,30827,705,0001,178,0002,113,536