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 listMay 24, 2026 13:09Victor MerckléVictor MerckléScore: 4,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 13:104,85348,076,37339,253,0001,032,0002,113,536
2May 24, 2026 13:104,86650,374,24639,372,0001,020,0002,113,536
3May 24, 2026 13:104,87148,771,97239,423,0001,010,0002,113,536
4May 24, 2026 13:104,87348,222,67439,451,0001,003,0002,113,536
5May 24, 2026 13:104,87550,030,19839,445,0001,020,0002,113,536
6May 24, 2026 13:104,90149,044,38639,642,0001,038,0002,113,536
7May 24, 2026 13:104,90648,851,42739,717,0001,009,0002,113,536
8May 24, 2026 13:104,94050,793,53039,939,0001,071,0002,113,536
9May 24, 2026 13:104,95651,024,39440,069,0001,071,0002,113,536