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 25, 2026 15:15Victor MerckléVictor MerckléScore: 7,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:167,74871,833,22863,206,0001,103,0002,113,536
2Jun 25, 2026 15:167,75471,880,04763,254,0001,108,0002,113,536
3Jun 25, 2026 15:167,75671,905,89263,298,0001,078,0002,113,536
4Jun 25, 2026 15:167,76071,937,28963,334,0001,079,0002,113,536
5Jun 25, 2026 15:167,76571,954,82063,352,0001,105,0002,113,536
6Jun 25, 2026 15:167,80472,261,56463,775,0001,003,0002,113,536
7Jun 25, 2026 15:167,80672,319,82263,778,0001,016,0002,113,536
8Jun 25, 2026 15:167,83072,522,11063,895,0001,094,0002,113,536
9Jun 25, 2026 15:167,84772,594,13364,059,0001,074,0002,113,536