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 05:06Andrew EpsteinAndrew EpsteinScore: 52,235Success
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 05:2952,098441,791,946430,410,0002,010,0002,121,728stderr
2Nov 3, 2026 05:2952,128442,659,557430,602,0002,068,0002,121,728stderr
3Nov 3, 2026 05:2952,214442,762,951431,370,0002,011,0002,121,728stderr
4Nov 3, 2026 05:2952,230443,255,815431,502,0002,011,0002,121,728stderr
5Nov 3, 2026 05:2952,235443,576,497431,539,0002,012,0002,121,728stderr
6Nov 3, 2026 05:2952,243442,975,141431,601,0002,023,0002,121,728stderr
7Nov 3, 2026 05:2952,270445,422,650431,794,0002,052,0002,121,728stderr
8Nov 3, 2026 05:2952,282443,677,963431,940,0002,003,0002,121,728stderr
9Nov 3, 2026 05:2952,370444,460,335432,671,0002,005,0002,121,728stderr