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 19, 2026 16:39DanielDanielScore: 51,540Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 16:4051,063435,251,891411,306,00012,518,00036,864
2Oct 19, 2026 16:4051,092434,911,557415,767,0008,299,00036,864
3Oct 19, 2026 16:4051,166435,656,458416,021,0008,663,00036,864
4Oct 19, 2026 16:4051,402437,909,351417,840,0008,797,0002,129,920
5Oct 19, 2026 16:4051,540438,547,967415,553,00012,235,0002,129,920
6Oct 19, 2026 16:4051,588439,111,895415,359,00012,822,00036,864
7Oct 19, 2026 16:4051,595439,631,181417,171,00011,068,0002,129,920
8Oct 19, 2026 16:4051,889441,548,584417,984,00012,698,00036,864
9Oct 19, 2026 16:4051,987442,426,277417,173,00014,325,0002,129,920