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 24, 2026 07:45Nao MinamiNao MinamiScore: 14,199Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 25, 2026 16:21Andrew Epstein15.72CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 07:4614,184129,235,005116,561,0001,172,0002,113,536
2Oct 24, 2026 07:4614,186128,711,519116,503,0001,243,0002,113,536
3Oct 24, 2026 07:4614,189129,428,483116,533,0001,242,0002,113,536
4Oct 24, 2026 07:4614,194129,276,130116,584,0001,229,0002,113,536
5Oct 24, 2026 07:4614,199129,389,703116,606,0001,252,0002,113,536
6Oct 24, 2026 07:4614,216128,902,967116,818,0001,181,0002,113,536
7Oct 24, 2026 07:4614,224129,094,062116,811,0001,254,0002,113,536
8Oct 24, 2026 07:4614,226129,061,005116,836,0001,246,0002,113,536
9Oct 24, 2026 07:4614,230129,155,704117,092,0001,018,0002,113,536