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 14, 2024 15:59Joad NacerJoad NacerScore: 4,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 15:594,32765,064,05134,886,0001,026,0002,273,280
2Oct 14, 2024 15:594,34259,179,57634,039,0002,002,0002,301,952
3Oct 14, 2024 15:594,36563,421,12433,214,0003,019,0002,535,424
4Oct 14, 2024 15:594,40163,014,48535,514,0001,014,0002,531,328
5Oct 14, 2024 15:594,43966,314,76735,850,000995,0002,293,760
6Oct 14, 2024 15:594,44858,988,67235,919,000997,0002,301,952