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 listJan 12, 2026 09:42Petsku01Petsku01Score: 1,075,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 09:421,075,6365,297,835,7625,051,759,000218,859,0002,281,472
2Jan 12, 2026 09:421,075,7665,300,103,5465,056,366,000214,888,0002,494,464
3Jan 12, 2026 09:421,076,0485,303,950,8585,052,774,000219,859,0002,281,472