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 listDec 23, 2025 05:03Josu San MartinJosu San MartinScore: 542,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 05:03536,6312,666,132,9702,608,537,00020,956,0002,453,504
2Dec 23, 2025 05:03542,2262,685,058,6782,627,975,00028,933,0002,281,472
3Dec 23, 2025 05:03572,7382,832,439,4262,784,438,00021,979,0002,424,832