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 13, 2025 19:08Valentin KofmanValentin KofmanScore: 148,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2025 19:08148,338749,782,675724,856,0001,999,0002,273,280
2Jul 13, 2025 19:08148,374750,981,372726,034,0001,000,0002,273,280
3Jul 13, 2025 19:08148,402749,747,125726,170,0001,000,0002,273,280
4Jul 13, 2025 19:08148,406752,837,651726,190,0001,000,0002,273,280
5Jul 13, 2025 19:08148,490750,764,321725,603,0001,998,0002,265,088
6Jul 13, 2025 19:08148,544751,206,178725,868,0001,999,0002,273,280
7Jul 13, 2025 19:08148,774753,035,531728,991,00002,273,280
8Jul 13, 2025 19:08148,844750,330,489727,340,0001,998,0002,273,280
9Jul 13, 2025 19:08148,925756,746,461728,732,000999,0002,400,256