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:30Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 20, 2026 23:44zielaj10.00RecheckSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 23:44022,185,22301,585,000249,856Exit with code 2: panic: runtime error: index out of range [939504638] with length 256 goroutine 1 [running]: main.main() /src/main.go:32 +0x208stderr
2May 19, 2021 19:305,29399,321,66725,933,82502,256,896
3May 19, 2021 19:305,70896,855,95327,967,05802,179,072
4May 19, 2021 19:305,73788,293,09128,112,25202,240,512