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 listNov 3, 2026 12:21Andrew EpsteinAndrew EpsteinScore: 111,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 12:30111,122931,676,826919,300,0003,019,0002,121,728stderr
2Nov 3, 2026 12:30111,203932,269,081919,783,0003,206,0002,121,728stderr
3Nov 3, 2026 12:30111,255932,771,639920,413,0003,011,0002,121,728stderr
4Nov 3, 2026 12:30111,278932,940,658920,553,0003,061,0002,121,728stderr
5Nov 3, 2026 12:30111,309933,210,607920,784,0003,084,0002,121,728stderr
6Nov 3, 2026 12:30111,601935,800,301923,176,0003,116,0002,121,728stderr
7Nov 3, 2026 12:30111,665936,152,724923,673,0003,153,0002,121,728stderr
8Nov 3, 2026 12:30111,770937,480,004924,662,0003,032,0002,121,728stderr
9Nov 3, 2026 12:30112,095941,240,205927,382,0003,010,0002,121,728stderr