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 30, 2026 08:38Saif Al-HarthiSaif Al-HarthiScore: 12,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2026 08:3812,633114,178,919103,822,0001,037,0002,113,536
2Jun 30, 2026 08:3812,641114,300,867103,899,0001,027,0002,113,536
3Jun 30, 2026 08:3812,642114,270,040103,902,0001,029,0002,113,536
4Jun 30, 2026 08:3812,644114,277,326103,926,0001,025,0002,113,536
5Jun 30, 2026 08:3812,647114,282,213103,804,0001,171,0002,113,536
6Jun 30, 2026 08:3812,654114,427,856103,990,0001,045,0002,113,536
7Jun 30, 2026 08:3812,655119,121,481103,966,0001,077,0002,113,536
8Jun 30, 2026 08:3812,668114,525,660104,040,0001,111,0002,113,536
9Jun 30, 2026 08:3812,945116,768,270106,346,0001,105,0002,113,536