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 11:21Andrew EpsteinAndrew EpsteinScore: 36,973Success
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 11:2136,854315,257,249303,881,0002,013,0002,125,824stderr
2Nov 3, 2026 11:2136,908315,605,170304,336,0002,007,0002,125,824stderr
3Nov 3, 2026 11:2136,956316,037,355304,720,0002,022,0002,121,728stderr
4Nov 3, 2026 11:2136,969316,174,121304,834,0002,010,0002,125,824stderr
5Nov 3, 2026 11:2136,973316,832,004304,868,0002,012,0002,125,824stderr
6Nov 3, 2026 11:2137,028317,104,452305,328,0002,008,0002,125,824stderr
7Nov 3, 2026 11:2137,043317,202,005305,452,0002,007,0002,125,824stderr
8Nov 3, 2026 11:2137,051317,285,829305,496,0002,028,0002,121,728stderr
9Nov 3, 2026 11:2137,087317,562,839305,816,0002,010,0002,129,920stderr