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 06:01Andrew EpsteinAndrew EpsteinScore: 72,731Success
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 06:0172,347609,829,099598,475,0002,012,0002,121,728stderr
2Nov 3, 2026 06:0172,384610,058,257598,784,0002,008,0002,121,728stderr
3Nov 3, 2026 06:0172,489611,542,306599,653,0002,013,0002,121,728stderr
4Nov 3, 2026 06:0172,539611,805,936600,065,0002,009,0002,121,728stderr
5Nov 3, 2026 06:0172,731613,483,206601,656,0002,013,0002,121,728stderr
6Nov 3, 2026 06:0172,800614,086,411602,239,0002,004,0002,121,728stderr
7Nov 3, 2026 06:0172,807613,645,453602,295,0002,011,0002,121,728stderr
8Nov 3, 2026 06:0172,960615,373,795603,536,0002,037,0002,121,728stderr
9Nov 3, 2026 06:0173,074615,866,442604,510,0002,010,0002,121,728stderr