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 listMay 7, 2026 09:56wnwnScore: 3,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 09:563,39143,316,98827,080,0001,066,0002,482,176
2May 7, 2026 09:563,40042,937,42927,137,0001,083,0002,478,080
3May 7, 2026 09:563,40544,126,22127,167,0001,102,0002,482,176
4May 7, 2026 09:563,40743,817,53327,184,0001,102,0002,486,272
5May 7, 2026 09:563,42141,067,17627,325,0001,076,0002,478,080
6May 7, 2026 09:563,49142,630,13327,878,0001,099,0002,490,368
7May 7, 2026 09:563,55744,867,46028,436,0001,094,0002,482,176
8May 7, 2026 09:563,59648,090,14928,760,0001,090,0002,490,368
9May 7, 2026 09:563,60145,810,04428,786,0001,110,0002,490,368