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 listMar 29, 2026 18:55Dominique GarmierDominique GarmierScore: 2,973,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 18:552,973,22714,606,395,96514,566,814,0001,999,0002,281,472
2Mar 29, 2026 18:552,973,95914,608,533,47314,570,400,0001,999,0002,281,472
3Mar 29, 2026 18:552,974,30314,601,830,99814,572,084,0001,999,0002,289,664