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 2, 2026 05:58Karthik ReddyKarthik ReddyScore: 3,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 05:593,3283,036,661,43427,624,000020,480
2Oct 2, 2026 05:593,3333,037,058,77427,671,000020,480
3Oct 2, 2026 05:593,3463,036,786,27227,776,000020,480
4Oct 2, 2026 05:593,3773,037,004,42928,036,000020,480
5Oct 2, 2026 05:593,3793,037,077,20528,048,000020,480
6Oct 2, 2026 05:593,3823,037,053,93228,076,000020,480
7Oct 2, 2026 05:593,3873,037,192,61528,113,000020,480
8Oct 2, 2026 05:593,3943,037,193,75828,176,000020,480
9Oct 2, 2026 05:593,4063,037,920,78728,275,000020,480