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 listAug 6, 2026 20:23TonyTonyScore: 19,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 6, 2026 20:2319,048168,836,199156,859,0001,241,0002,113,536
2Aug 6, 2026 20:2319,070169,007,344157,140,0001,142,0002,113,536
3Aug 6, 2026 20:2319,273170,753,644158,710,0001,262,0002,113,536
4Aug 6, 2026 20:2319,402171,051,252159,892,0001,150,0002,113,536
5Aug 6, 2026 20:2319,403171,102,854159,888,0001,163,0002,113,536
6Aug 6, 2026 20:2319,412171,106,234159,896,0001,227,0002,113,536
7Aug 6, 2026 20:2319,413171,135,657159,903,0001,231,0002,113,536
8Aug 6, 2026 20:2319,416171,930,164159,927,0001,230,0002,113,536
9Aug 6, 2026 20:2319,422172,017,247160,202,0001,007,0002,113,536