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 listJul 31, 2026 19:55anboto1anboto1Score: 156,224Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:56154,571767,496,778754,246,0003,155,0002,113,536
2Jul 31, 2026 19:56155,292770,909,689759,866,0001,067,0002,113,536
3Jul 31, 2026 19:56155,380771,387,957760,310,0001,053,0002,113,536
4Jul 31, 2026 19:56156,161775,256,260763,132,0002,058,0002,113,536
5Jul 31, 2026 19:56156,224775,432,610764,439,0001,059,0002,113,536
6Jul 31, 2026 19:56156,338776,091,226763,897,0002,163,0002,113,536
7Jul 31, 2026 19:56156,802778,315,819767,274,0001,058,0002,113,536
8Jul 31, 2026 19:56157,049779,413,048768,495,0001,049,0002,113,536
9Jul 31, 2026 19:56159,448791,378,018779,230,0002,068,0002,113,536