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:03Andrew EpsteinAndrew EpsteinScore: 85,841Success
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:0885,594720,194,497708,433,0002,004,0002,121,728stderr
2Nov 3, 2026 12:0885,600719,832,353707,416,0003,066,0002,125,824stderr
3Nov 3, 2026 12:0885,783721,690,872709,996,0002,005,0002,121,728stderr
4Nov 3, 2026 12:0885,789721,370,190710,040,0002,013,0002,121,728stderr
5Nov 3, 2026 12:0885,841722,285,142709,465,0003,018,0002,121,728stderr
6Nov 3, 2026 12:0885,873722,517,373710,737,0002,010,0002,121,728stderr
7Nov 3, 2026 12:0885,905722,375,720711,008,0002,008,0002,121,728stderr
8Nov 3, 2026 12:0886,163724,917,868713,144,0002,009,0002,121,728stderr
9Nov 3, 2026 12:0886,391726,323,671715,028,0002,018,0002,121,728stderr