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 07:52wnwnScore: 3,467Success
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 07:533,44847,483,08227,600,0001,022,0002,486,272
2Apr 27, 2026 07:533,45342,620,39027,642,0001,023,0002,486,272
3Apr 27, 2026 07:533,45542,403,96828,678,00002,494,464
4Apr 27, 2026 07:533,45743,872,73828,699,00002,486,272
5Apr 27, 2026 07:533,46743,989,44026,794,0001,984,0002,326,528
6Apr 27, 2026 07:533,47343,796,73226,840,0001,988,0002,490,368
7Apr 27, 2026 07:533,61544,295,21028,007,0002,000,0002,478,080
8Apr 27, 2026 07:533,61950,513,17128,041,0002,002,0002,494,464
9Apr 27, 2026 07:533,62047,515,08329,045,0001,001,0002,478,080