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 24, 2026 20:18Dominique GarmierDominique GarmierScore: 276,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 04:15275,1501,375,967,3291,346,237,0001,998,0002,347,008
2Mar 24, 2026 20:18275,4121,375,378,1281,347,519,0001,999,0002,404,352
3Mar 25, 2026 04:15275,6851,384,074,7591,348,857,0001,998,0002,433,024
4Mar 24, 2026 20:18276,6051,381,665,7291,354,364,000999,0002,408,448
5Mar 25, 2026 04:15277,9551,392,686,2601,358,983,0002,997,0002,387,968
6Mar 24, 2026 20:18278,6661,395,727,4431,361,466,0003,998,0002,351,104