Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listMay 19, 2021 19:38Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 26, 2026 14:43Sergey Svistunov-RecheckSolution Broken
Apr 21, 2026 11:42zielaj10.00RecheckSolution Held
Apr 20, 2026 23:43zielaj10.00RecheckSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 16:4601,036,566,465882,000882,000270,336Exit with code 2: unexpected fault address 0xc39f8548a8 fatal error: fault [signal SIGSEGV: segmentation violation code=0x1 addr=0xc39f8548a8 pc=0x49747c] goroutine 1 [running]: runtime.throw(0x4ce9b1, 0x5) /compiler/src/runtime/panic.go:774 +0x72 fp...stderr
2May 19, 2021 19:384,8303,040,320,64723,666,20302,248,704
3May 19, 2021 19:384,8582,981,304,63323,806,47202,244,608
4May 19, 2021 19:384,8642,456,006,80323,832,97502,252,800