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 22, 2026 09:42wnwnScore: 4,719Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 09:424,63555,682,62537,461,0001,012,0002,482,176
2Apr 22, 2026 09:424,64355,009,33537,526,0001,014,0002,486,272
3Apr 22, 2026 09:424,68357,676,23336,880,0001,993,0002,478,080
4Apr 22, 2026 09:424,68557,390,58136,896,0001,994,0002,482,176
5Apr 22, 2026 09:424,71958,386,12538,166,0001,004,0002,486,272
6Apr 22, 2026 09:424,74754,851,97038,395,0001,010,0002,478,080
7Apr 22, 2026 09:424,82058,909,55538,006,0002,000,0002,490,368
8Apr 22, 2026 09:424,85456,350,98039,287,0001,007,0002,494,464
9Apr 22, 2026 09:424,91956,643,08738,843,0001,991,0002,326,528