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 20, 2026 16:29Nao MinamiNao MinamiScore: 63,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 16:2963,531538,276,198474,035,00053,280,0002,117,632
2Oct 20, 2026 16:2963,566538,501,598474,335,00053,267,0002,117,632
3Oct 20, 2026 16:2963,579538,522,279474,221,00053,488,0002,117,632
4Oct 20, 2026 16:2963,579538,583,465474,381,00053,329,0002,117,632
5Oct 20, 2026 16:2963,584538,634,865474,375,00053,374,0002,117,632
6Oct 20, 2026 16:2963,596539,029,333474,542,00053,307,0002,117,632
7Oct 20, 2026 16:2963,617538,853,297474,699,00053,330,0002,117,632
8Oct 20, 2026 16:2963,662539,113,759475,101,00053,301,0002,117,632
9Oct 20, 2026 16:2963,695539,414,486474,391,00054,285,0002,117,632