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

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

Challenge History
DateChallengerCostTypeStatus
Apr 20, 2026 23:42zielaj10.00RecheckSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 23:420615,560,32813,282,0001,021,0002,506,752expected "560379739648 ", got "688033958 "
2Apr 20, 2026 23:420402,456,47912,458,0001,916,0002,506,752expected "560377188039 ", got "1544406187 "
3Apr 20, 2026 23:4201,874,653,47911,409,0002,852,0002,506,752expected "560367892074 ", got "2061866272 "
4May 19, 2021 19:292,990478,139,59714,652,12602,256,896
5May 19, 2021 19:293,0061,791,825,08614,730,88302,314,240
6May 19, 2021 19:293,009792,568,56614,743,93002,244,608