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 17, 2026 19:41Pavel SkripkinPavel SkripkinScore: 258,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 19:41258,2011,291,494,6551,263,189,0001,998,0002,531,328
2Mar 17, 2026 19:41258,2191,289,995,1171,263,274,0001,998,0002,441,216
3Mar 17, 2026 19:41258,2781,290,770,1341,263,565,0001,999,0002,437,120
4Mar 17, 2026 19:41258,3291,291,695,5641,265,811,00002,269,184
5Mar 17, 2026 19:41258,3511,296,458,3731,265,920,00002,531,328
6Mar 17, 2026 19:41258,3861,289,927,4591,265,094,000999,0002,437,120
7Mar 17, 2026 19:41258,4171,295,480,7361,265,245,000999,0002,428,928
8Mar 17, 2026 19:41258,5331,290,953,7121,265,814,000999,0002,269,184
9Mar 17, 2026 19:41258,8621,292,332,9301,266,425,0001,999,0002,441,216