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 24, 2026 15:22Andrew EpsteinAndrew EpsteinScore: 274,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 15:23274,5501,355,845,4821,344,184,0001,115,0002,117,632stderr
2Sep 24, 2026 15:23274,5801,356,100,7621,343,322,0002,124,0002,117,632stderr
3Sep 24, 2026 15:23274,6001,355,970,8521,344,430,0001,111,0002,117,632stderr
4Sep 24, 2026 15:23274,6381,356,308,3231,343,489,0002,238,0002,117,632stderr
5Sep 24, 2026 15:23274,6601,356,343,8141,344,726,0001,110,0002,117,632stderr
6Sep 24, 2026 15:23274,6801,356,628,6251,344,808,0001,126,0002,117,632stderr
7Sep 24, 2026 15:23274,6861,356,539,9761,344,861,0001,103,0002,117,632stderr
8Sep 24, 2026 15:23274,8361,361,895,3971,345,394,0001,306,0002,117,632stderr
9Sep 24, 2026 15:23275,3011,359,484,7341,347,870,0001,107,0002,117,632stderr