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 listJan 31, 2026 21:39olliecrowolliecrowScore: 6,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 21:396,04373,882,29846,149,0004,012,0002,375,680
2Jan 31, 2026 21:396,06084,529,19049,295,0001,006,0002,269,184
3Jan 31, 2026 21:396,08773,162,34048,501,0002,020,0002,387,968
4Jan 31, 2026 21:396,36376,271,45051,816,000996,0002,289,664
5Jan 31, 2026 21:396,36379,663,68749,822,0002,989,0002,392,064
6Jan 31, 2026 21:396,45081,227,26249,499,0004,040,0002,510,848