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 28, 2024 18:50RileyRileyScore: 56,257Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 28, 2024 18:5056,040487,716,686463,128,0002,000,0002,355,200
2Oct 28, 2024 18:5056,238490,501,738465,779,000999,0002,289,664
3Oct 28, 2024 18:5056,242488,657,153464,808,0001,999,0002,293,760
4Oct 28, 2024 18:5056,253489,769,813464,903,0001,999,0002,289,664
5Oct 28, 2024 18:5056,257492,140,768464,932,0001,999,0002,289,664
6Oct 28, 2024 18:5056,259493,933,862465,948,000999,0002,289,664
7Oct 28, 2024 18:5056,273489,354,785466,062,0001,000,0002,269,184
8Oct 28, 2024 18:5056,287497,084,708466,182,0001,000,0002,269,184
9Oct 28, 2024 18:5056,298491,402,470466,277,0001,000,0002,523,136