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 listFeb 19, 2026 16:27Serhii SakhnoSerhii SakhnoScore: 85,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 16:2784,722725,254,878701,190,0002,000,0002,277,376
2Feb 19, 2026 16:2784,758731,182,094701,492,0001,998,0002,277,376
3Feb 19, 2026 16:2784,775728,637,003701,637,0001,998,0002,277,376
4Feb 19, 2026 16:2785,154736,588,688704,783,0001,999,0002,277,376
5Feb 19, 2026 16:2785,384741,610,569705,693,0002,998,0002,277,376
6Feb 19, 2026 16:2785,433736,894,561707,094,0002,000,0002,277,376
7Feb 19, 2026 16:2785,451736,880,643708,242,000998,0002,277,376
8Feb 19, 2026 16:2785,482738,453,866707,503,0001,998,0002,535,424
9Feb 19, 2026 16:2785,484740,357,152707,516,0001,998,0002,277,376