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 14:18Andrew EpsteinAndrew EpsteinScore: 291,977Success
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 14:19291,7691,440,170,0801,428,563,0001,109,0002,117,632stderr
2Sep 24, 2026 14:19291,8281,440,737,2341,428,854,0001,108,0002,117,632stderr
3Sep 24, 2026 14:19291,8731,440,689,7821,429,071,0001,110,0002,117,632stderr
4Sep 24, 2026 14:19291,9051,441,033,7291,429,233,0001,106,0002,117,632stderr
5Sep 24, 2026 14:19291,9771,441,356,0091,429,582,0001,107,0002,117,632stderr
6Sep 24, 2026 14:19292,5031,443,904,1051,432,149,0001,117,0002,117,632stderr
7Sep 24, 2026 14:19292,8271,446,097,8501,433,730,0001,123,0002,117,632stderr
8Sep 24, 2026 14:19293,8211,450,515,8581,438,488,0001,239,0002,117,632stderr
9Sep 24, 2026 14:19378,3361,864,387,7241,852,739,0001,112,0002,117,632stderr