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 listJul 15, 2026 00:29boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 00:290121,165,885110,432,0001,054,0002,113,536expected "53691314592284078 ", got "Start: 0x7b2c40c00000---- Start: 0x7b2c40c00000---- 53691314592284078 "
2Jul 15, 2026 00:290128,594,625115,046,0001,011,0002,113,536expected "53689068440143048 ", got "Start: 0x75a948600000---- Start: 0x75a948600000---- 53689068440143048 "
3Jul 15, 2026 00:290123,003,600111,654,0001,070,0002,113,536expected "53689849249793532 ", got "Start: 0x7d8749400000---- Start: 0x7d8749400000---- 53689849249793532 "