Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 14, 2026 14:11Mikołaj UzarskiMikołaj UzarskiScore: 10,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 14:1110,274106,913,74983,270,0002,006,0002,506,752
2Mar 14, 2026 14:1110,695112,454,20386,776,0001,994,0002,510,848
3Mar 14, 2026 14:1110,698115,466,62687,793,000997,0002,281,472
4Mar 14, 2026 14:1110,699120,110,64487,802,000997,0002,281,472
5Mar 14, 2026 14:1110,793118,746,83589,578,00002,281,472
6Mar 14, 2026 14:1110,886112,144,58688,345,0002,007,0002,281,472
7Mar 14, 2026 14:1111,062122,825,19889,819,0001,995,0002,506,752
8Mar 14, 2026 14:1111,087117,263,39091,019,0001,000,0002,281,472
9Mar 14, 2026 14:1112,747132,906,114104,799,000998,0002,506,752