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 listOct 12, 2026 20:27Karthik ReddyKarthik ReddyScore: 24,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 20:2824,120127,623,609117,081,0001,108,00020,480
2Oct 12, 2026 20:2824,123127,146,998117,132,0001,074,00020,480
3Oct 12, 2026 20:2824,133127,121,324117,251,0001,002,00020,480
4Oct 12, 2026 20:2824,134127,306,251117,171,0001,090,00020,480
5Oct 12, 2026 20:2824,134127,182,420117,188,0001,069,00020,480
6Oct 12, 2026 20:2824,140127,230,085117,225,0001,062,00020,480
7Oct 12, 2026 20:2824,152127,285,509117,285,0001,063,00020,480
8Oct 12, 2026 20:2824,168127,311,970117,351,0001,076,00020,480
9Oct 12, 2026 20:2824,206127,487,110117,556,0001,058,00020,480