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 listSep 3, 2026 16:30Victor MerckléVictor MerckléScore: 25,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 16:3125,519133,495,068124,032,0001,014,0002,117,632stderr
2Sep 3, 2026 16:3125,524134,660,419124,052,0001,019,0002,117,632stderr
3Sep 3, 2026 16:3125,524133,500,370124,052,0001,016,0002,117,632stderr
4Sep 3, 2026 16:3125,542133,668,069124,082,0001,076,0002,117,632stderr
5Sep 3, 2026 16:3125,550133,666,003124,100,0001,099,0002,117,632stderr
6Sep 3, 2026 16:3125,553133,747,533124,117,0001,094,0002,117,632stderr
7Sep 3, 2026 16:3125,558133,673,088124,139,0001,100,0002,117,632stderr
8Sep 3, 2026 16:3125,563133,698,074124,169,0001,091,0002,117,632stderr
9Sep 3, 2026 16:3125,578133,868,060124,207,0001,128,0002,117,632stderr