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:43Andrew EpsteinAndrew EpsteinScore: 33,965Success
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:4333,816290,029,079278,644,0002,033,0002,121,728stderr
2Nov 3, 2026 05:4333,912290,962,314279,425,0002,052,0002,121,728stderr
3Nov 3, 2026 05:4333,917290,715,680279,462,0002,053,0002,121,728stderr
4Nov 3, 2026 05:4333,917291,267,857279,477,0002,036,0002,121,728stderr
5Nov 3, 2026 05:4333,965291,218,314279,867,0002,045,0002,121,728stderr
6Nov 3, 2026 05:4333,966291,753,051279,885,0002,039,0002,121,728stderr
7Nov 3, 2026 05:4333,982291,417,873280,037,0002,017,0002,121,728stderr
8Nov 3, 2026 05:4334,061292,426,684280,652,0002,058,0002,121,728stderr
9Nov 3, 2026 05:4334,076292,114,683280,803,0002,032,0002,121,728stderr