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 listOct 10, 2024 12:19Joad NacerJoad NacerScore: 8,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 12:197,33086,922,15258,843,0001,994,0002,535,424
2Oct 10, 2024 12:197,33092,655,56559,842,000997,0002,273,280
3Oct 10, 2024 12:197,33780,941,92859,900,000998,0002,273,280
4Oct 10, 2024 12:198,28295,442,69968,743,00002,420,736
5Oct 10, 2024 12:198,28896,563,28466,800,0001,994,0002,424,832
6Oct 10, 2024 12:198,33692,820,69167,183,0002,005,0002,420,736