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 listJun 11, 2026 01:05Victor MerckléVictor MerckléScore: 6,203Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 01:066,14958,676,86649,781,0001,263,0002,113,536
2Jun 11, 2026 01:066,16258,790,02950,107,0001,040,0002,113,536
3Jun 11, 2026 01:066,18159,216,46050,239,0001,064,0002,113,536
4Jun 11, 2026 01:066,18458,985,62950,284,0001,046,0002,113,536
5Jun 11, 2026 01:066,20359,163,45250,454,0001,031,0002,113,536
6Jun 11, 2026 01:066,20559,157,86350,273,0001,233,0002,113,536
7Jun 11, 2026 01:066,24359,454,08850,772,0001,049,0002,113,536
8Jun 11, 2026 01:066,39661,042,91252,075,0001,015,0002,113,536
9Jun 11, 2026 01:066,51061,704,69052,984,0001,049,0002,113,536