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 21:04Karthik ReddyKarthik ReddyScore: 3,731Success
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 21:063,7213,040,010,09526,349,0004,536,00020,480
2Oct 2, 2026 21:063,7243,039,997,61426,329,0004,588,00020,480
3Oct 2, 2026 21:063,7273,040,088,94226,463,0004,477,00020,480
4Oct 2, 2026 21:063,7293,039,959,23626,367,0004,588,00020,480
5Oct 2, 2026 21:063,7313,040,088,55926,442,0004,531,00020,480
6Oct 2, 2026 21:063,7403,040,058,70526,485,0004,562,00020,480
7Oct 2, 2026 21:063,7573,040,343,30826,558,0004,629,00020,480
8Oct 2, 2026 21:063,7713,040,320,76026,597,0004,708,00020,480
9Oct 2, 2026 21:063,7983,040,617,31326,841,0004,684,00020,480