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 18:30Karthik ReddyKarthik ReddyScore: 3,621Success
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 18:313,6123,039,027,45026,267,0003,719,00020,480
2Oct 2, 2026 18:313,6133,040,068,97326,288,0003,706,00020,480
3Oct 2, 2026 18:313,6183,039,218,73226,334,0003,700,00020,480
4Oct 2, 2026 18:313,6193,039,187,84226,322,0003,722,00020,480
5Oct 2, 2026 18:313,6213,039,205,25726,198,0003,863,00020,480
6Oct 2, 2026 18:313,6223,039,070,48926,201,0003,866,00020,480
7Oct 2, 2026 18:313,6233,039,237,08526,165,0003,908,00020,480
8Oct 2, 2026 18:313,6243,039,255,20326,146,0003,940,00020,480
9Oct 2, 2026 18:313,6653,039,538,41526,386,0004,039,00020,480