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:51RileyRileyScore: 56,262Success
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:5156,228493,085,864464,695,0001,998,0002,289,664
2Oct 28, 2024 18:5156,230494,790,445464,715,0001,998,0002,289,664
3Oct 28, 2024 18:5156,251489,223,558465,883,000999,0002,281,472
4Oct 28, 2024 18:5156,261494,574,191465,967,000999,0002,293,760
5Oct 28, 2024 18:5156,262490,116,541464,977,0001,999,0002,281,472
6Oct 28, 2024 18:5156,264491,022,182464,994,0001,999,0002,265,088
7Oct 28, 2024 18:5156,267494,124,119465,013,0002,000,0002,289,664
8Oct 28, 2024 18:5156,273492,300,994465,065,0002,000,0002,289,664
9Oct 28, 2024 18:5156,283498,429,917465,147,0002,000,0002,289,664