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,501Success
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,31963,947,39132,862,0002,987,0002,535,424
2Oct 14, 2024 15:594,40658,022,58335,553,0001,015,0002,310,144
3Oct 14, 2024 15:594,44259,468,45535,874,000996,0002,269,184
4Oct 14, 2024 15:594,50157,697,59936,351,0001,009,0002,306,048
5Oct 14, 2024 15:594,61361,757,97837,284,0001,007,0002,531,328
6Oct 14, 2024 15:594,64370,377,44234,483,0004,056,0002,273,280