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 listApr 27, 2026 10:16wnwnScore: 3,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:173,39447,329,40227,167,0001,006,0002,482,176
2Apr 27, 2026 10:173,44144,303,46227,543,0001,020,0002,478,080
3Apr 27, 2026 10:173,46846,413,58626,800,0001,985,0002,482,176
4Apr 27, 2026 10:173,49341,746,28126,094,0002,899,0002,310,144
5Apr 27, 2026 10:173,53250,111,53828,308,0001,011,0002,498,560
6Apr 27, 2026 10:173,55346,972,34528,480,0001,017,0002,326,528
7Apr 27, 2026 10:173,55546,583,96728,492,0001,017,0002,486,272
8Apr 27, 2026 10:173,58246,583,54527,756,0001,982,0002,494,464
9Apr 27, 2026 10:173,65144,512,85630,308,00002,478,080