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 17:35Karthik ReddyKarthik ReddyScore: 3,668Success
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 17:363,6283,040,612,54026,458,0003,662,00020,480
2Oct 2, 2026 17:363,6363,039,200,57226,464,0003,716,00020,480
3Oct 2, 2026 17:363,6463,039,380,64226,557,0003,712,00020,480
4Oct 2, 2026 17:363,6603,039,455,73426,601,0003,785,00020,480
5Oct 2, 2026 17:363,6683,040,300,68926,873,0003,575,00020,480
6Oct 2, 2026 17:363,6693,039,522,08626,587,0003,870,00020,480
7Oct 2, 2026 17:363,6883,039,734,54627,133,0003,481,00020,480
8Oct 2, 2026 17:363,7153,039,889,47626,895,0003,946,00020,480
9Oct 2, 2026 17:363,7533,040,251,61827,253,0003,898,00020,480