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 listAug 28, 2026 19:18Josu San MartinJosu San MartinScore: 25,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:1925,129131,534,803121,890,0001,245,0002,113,536
2Aug 28, 2026 19:1925,131131,566,046122,126,0001,016,0002,113,536
3Aug 28, 2026 19:1925,136131,634,773121,916,0001,253,0002,113,536
4Aug 28, 2026 19:1925,148131,663,514121,978,0001,248,0002,113,536
5Aug 28, 2026 19:1925,168131,707,636122,071,0001,253,0002,113,536
6Aug 28, 2026 19:1925,186131,905,606122,366,0001,048,0002,113,536
7Aug 28, 2026 19:1925,205131,927,174122,257,0001,249,0002,113,536
8Aug 28, 2026 19:1925,238131,848,104122,534,0001,134,0002,113,536
9Aug 28, 2026 19:1925,534134,054,561123,860,0001,259,0002,113,536