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 listJun 6, 2026 15:36merripiummerripiumScore: 71,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 15:3771,597603,386,717540,003,00054,253,0002,113,536
2Jun 6, 2026 15:3771,602603,358,197540,028,00054,275,0002,113,536
3Jun 6, 2026 15:3771,627603,708,992540,260,00054,250,0002,113,536
4Jun 6, 2026 15:3771,630603,814,695540,280,00054,256,0002,113,536
5Jun 6, 2026 15:3771,637603,632,614540,345,00054,248,0002,113,536
6Jun 6, 2026 15:3771,703604,315,916539,916,00055,219,0002,113,536
7Jun 6, 2026 15:3771,708604,349,442539,930,00055,248,0002,113,536
8Jun 6, 2026 15:3771,754604,744,413540,279,00055,287,0002,113,536
9Jun 6, 2026 15:3771,830605,278,285539,881,00056,312,0002,113,536