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 19:01Andrew EpsteinAndrew EpsteinScore: 321,054Success
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 19:02318,6121,572,437,8131,560,084,0001,116,0002,117,632stderr
2Sep 24, 2026 19:02319,9631,578,374,8341,566,716,0001,104,0002,117,632stderr
3Sep 24, 2026 19:02320,1051,579,067,2411,567,403,0001,116,0002,117,632stderr
4Sep 24, 2026 19:02320,3351,580,883,2121,568,538,0001,105,0002,117,632stderr
5Sep 24, 2026 19:02321,0541,584,413,6411,572,057,0001,110,0002,117,632stderr
6Sep 24, 2026 19:02321,1131,584,017,8031,572,344,0001,112,0002,117,632stderr
7Sep 24, 2026 19:02322,1531,589,242,0041,577,449,0001,104,0002,117,632stderr
8Sep 24, 2026 19:02322,9031,593,460,1581,581,121,0001,108,0002,117,632stderr
9Sep 24, 2026 19:02324,8461,605,338,9571,590,637,0001,113,0002,117,632stderr