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 10:14Andrew EpsteinAndrew EpsteinScore: 33,941Success
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 10:2033,787289,791,403278,377,0002,056,0002,121,728stderr
2Nov 3, 2026 10:2033,831291,972,457278,726,0002,073,0002,121,728stderr
3Nov 3, 2026 10:2033,890290,551,726279,260,0002,030,0002,121,728stderr
4Nov 3, 2026 10:2033,906290,842,512279,418,0002,005,0002,121,728stderr
5Nov 3, 2026 10:2033,941291,463,813279,667,0002,050,0002,121,728stderr
6Nov 3, 2026 10:2033,993291,471,449280,117,0002,031,0002,121,728stderr
7Nov 3, 2026 10:2034,010291,583,816280,277,0002,010,0002,121,728stderr
8Nov 3, 2026 10:2034,044291,890,900280,545,0002,027,0002,121,728stderr
9Nov 3, 2026 10:2034,123292,620,469281,212,0002,015,0002,121,728stderr