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 26, 2026 18:15Jasper EdbrookeJasper EdbrookeScore: 787,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 18:15774,69010,050,610,7881,496,204,0002,299,778,000229,376
2Mar 26, 2026 18:15779,27611,051,241,4961,501,573,0002,316,881,000184,320
3Mar 26, 2026 18:15779,29312,350,501,5011,484,144,0002,334,393,000208,896
4Mar 26, 2026 18:15782,93513,839,989,0871,544,504,0002,291,876,000200,704
5Mar 26, 2026 18:15787,30410,545,092,8171,408,922,0002,448,867,000180,224
6Mar 26, 2026 18:15789,28611,703,524,3031,591,911,0002,275,590,000237,568
7Mar 26, 2026 18:15789,69610,646,146,0081,501,741,0002,367,769,000180,224
8Mar 26, 2026 18:15789,87210,603,730,0021,450,994,0002,419,379,000180,224
9Mar 26, 2026 18:15799,35611,005,337,2831,734,346,0002,182,498,000180,224