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 listNov 8, 2026 20:12janwwwjanwwwScore: 26,820Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 20:1226,815140,766,755128,483,0002,915,00032,768stderr
2Nov 8, 2026 20:1226,816141,106,652128,509,0002,890,00032,768stderr
3Nov 8, 2026 20:1226,817141,139,028128,502,0002,906,00032,768stderr
4Nov 8, 2026 20:1226,818141,084,212128,509,0002,904,00032,768stderr
5Nov 8, 2026 20:1226,820140,303,456128,489,0002,930,00032,768stderr
6Nov 8, 2026 20:1226,822141,163,249128,531,0002,899,00032,768stderr
7Nov 8, 2026 20:1226,828140,706,651128,558,0002,903,00032,768stderr
8Nov 8, 2026 20:1226,834141,166,364128,578,0002,910,00032,768stderr
9Nov 8, 2026 20:1226,837141,156,367128,602,0002,900,00032,768stderr