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 31, 2026 11:42timothygktimothygkError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 11:460105,453,06182,108,00012,329,0002,150,400expected "53672917764977325 ", got "53673095174927470 "stderr
2Oct 31, 2026 11:4611,062103,780,60078,646,00013,169,0002,150,400stderr
3Oct 31, 2026 11:4611,065102,762,75779,099,00012,742,00053,248stderr
4Oct 31, 2026 11:4611,081102,844,53779,529,00012,448,00053,248stderr
5Oct 31, 2026 11:4611,136103,488,53879,144,00013,290,00053,248stderr
6Oct 31, 2026 11:4611,161103,688,72780,068,00012,569,00053,248stderr
7Oct 31, 2026 11:4611,175104,456,27779,779,00012,977,00053,248stderr
8Oct 31, 2026 11:4611,281105,167,09480,471,00013,168,0002,150,400stderr
9Oct 31, 2026 11:4611,319105,360,38980,994,00012,960,00053,248stderr